Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.73
URN: urn:nbn:de:0030-drops-110174
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11017/
Conte, Alessio ; Grossi, Roberto ; Kanté, Mamadou Moustapha ; Marino, Andrea ; Uno, Takeaki ; Wasa, Kunihiro
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{conte_et_al:LIPIcs:2019:11017,
author = {Alessio Conte and Roberto Grossi and Mamadou Moustapha Kant{\'e} and Andrea Marino and Takeaki Uno and Kunihiro Wasa},
title = {{Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {73:1--73:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11017},
URN = {urn:nbn:de:0030-drops-110174},
doi = {10.4230/LIPIcs.MFCS.2019.73},
annote = {Keywords: Graph algorithms, enumeration, listing and counting, Steiner trees, induced subgraphs}
}
| Keywords: | Graph algorithms, enumeration, listing and counting, Steiner trees, induced subgraphs | |
| Seminar: | 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 20.08.2019 |
