LIPIcs.MFCS.2019.73.pdf
- Filesize: 0.59 MB
- 14 pages
Document
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
Authors
-
Part of:
Volume:
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-08-20
Cite AsGet BibTex
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, and Kunihiro Wasa. Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 73:1-73:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.MFCS.2019.73
https://doi.org/10.4230/LIPIcs.MFCS.2019.73
Abstract
This paper investigates induced Steiner subgraphs as a variant of the classical Steiner trees, so as to compactly represent the (exponentially many) Steiner trees sharing the same underlying induced subgraph. We prove that the enumeration of all (inclusion-minimal) induced Steiner subgraphs is harder than the well-known Hypergraph Transversal enumeration problem if the number of terminals is not fixed. When the number of terminals is fixed, we propose a polynomial delay algorithm for listing all induced Steiner subgraphs of minimum size. We also propose a polynomial delay algorithm for listing the set of minimal induced Steiner subgraphs when the number of terminals is 3.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph enumeration
Keywords
- Graph algorithms
- enumeration
- listing and counting
- Steiner trees
- induced subgraphs
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads