A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph

Abstract

Discrete Algorithms

Keywords

• parameterized algorithms
• graph algorithms
• spanning trees
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]