Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage
- 16 March 2022
- book chapter
- Published by Springer Nature
- p. 251-262
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Independent domination in graphs: A survey and recent resultsDiscrete Mathematics, 2013
- Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short CyclesAlgorithmica, 2008
- The leafage of a chordal graphDiscussiones Mathematicae Graph Theory, 1998
- The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path GraphsJournal of Algorithms, 1996
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Steiner trees, connected domination and strongly chordal graphsNetworks, 1985
- A recognition algorithm for the intersection graphs of paths in treesDiscrete Mathematics, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A recognition algorithm for the intersection graphs of directed paths in directed treesDiscrete Mathematics, 1975
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974