A new algorithm for finding trees with many leaves (2001)
Cached
Download Links
by
Joachim Kneis
,
Alexander Langer
,
Peter Rossmanith
| Citations: | 9 - 1 self |
BibTeX
@MISC{Kneis01anew,
author = {Joachim Kneis and Alexander Langer and Peter Rossmanith},
title = {A new algorithm for finding trees with many leaves},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an algorithm that finds trees with at least k leaves in undirected and directed graphs. These problems are known as Maximum Leaf Spanning Tree for undirected graphs, and, respectively, Directed Maximum Leaf Out-Tree and Directed Maximum Leaf Spanning Out-Tree in the case of directed graphs. The run time of our algorithm is O(poly(|V |) + 4 k k 2) on undirected graphs, and O(4 k |V |·|E|) on directed graphs. Currently, the fastest algorithms for these problems have run times of O(poly(n) + 6.75 k poly(k)) and 2 O(k log k) poly(n), respectively.
