Skip to Main content Skip to Navigation
New interface
Conference papers

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-02335601
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Monday, October 28, 2019 - 1:35:00 PM
Last modification on : Friday, November 25, 2022 - 6:54:49 PM
Long-term archiving on: : Wednesday, January 29, 2020 - 4:08:10 PM

File

LIPIcs-MFCS-2019-73.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, et al.. Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.73⟩. ⟨hal-02335601⟩

Share

Metrics

Record views

54

Files downloads

89