FPT algorithm by treewidth and polynomial algorithm for chordal graphs for the Fully Leafed Induced Subtree problem.
Treewidth, Computations and Approximations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Leafed Induced Subtree in chordal and bounded treewidth graphs
FPT algorithm by treewidth and polynomial algorithm for chordal graphs for the Fully Leafed Induced Subtree problem.