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

Sorry, there's nothing here.

Topics

Cite this paper

@article{BinkeleRaible2014APM, title={A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph}, author={Daniel Binkele-Raible and Henning Fernau}, journal={Discrete Mathematics & Theoretical Computer Science}, year={2014}, volume={16}, pages={179-200} }