Steiner Trees for Hereditary Graph Classes-Reference-Cited by-同舟云学术

Steiner Trees for Hereditary Graph Classes

Published:2020 Issue: Volume: Page:613-624
ISSN:0302-9743
Container-title:LATIN 2020: Theoretical Informatics
language:
Short-container-title:

Author:

Bodlaender Hans L.^ORCID,Brettell Nick^ORCID,Johnson Matthew^ORCID,Paesani Giacomo^ORCID,Paulusma Daniël^ORCID,van Leeuwen Erik Jan

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-61792-9_48

Reference16 articles.

1. Bergougnoux, B., Kanté, M.M.: More applications of the d-neighbor equivalence: connectivity and acyclicity constraints. In: Proceeding of the 27th Annual European Symposium on Algorithms, ESA, LIPIcs, vol. 144, pp. 17:1–17:14 (2019)

2. Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32, 171–176 (1989)

3. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86–111 (2015)

4. Brandstädt, A., Müller, H.: The NP-completeness of Steiner Tree and Dominating Set for chordal bipartite graphs. Theor. Comput. Sci. 53, 257–265 (1987)

5. Chimani, M., Mutzel, P., Zey, B.: Improved Steiner tree algorithms for bounded treewidth. J. Discrete Algorithms 16, 67–78 (2012)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Steiner trees for hereditary graph classes: A treewidth perspective;Theoretical Computer Science;2021-05

2. Clique-Width: Harnessing the Power of Atoms;Graph-Theoretic Concepts in Computer Science;2020