Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
Solving Connected Dominating Set Faster than 2 n
Algorithmica - Parameterized and Exact Algorithms
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
A New Algorithm for Finding Trees with Many Leaves
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Parameterized and Exact Computation
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Spanning trees with many leaves in graphs without diamonds and blossoms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A faster exact algorithm for the directed maximum leaf spanning tree problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is known to be $\mathcal{NP}$-hard. We present an algorithm which finds a spanning tree with at least k leaves in time O *(3.4575 k ) which improves the currently best algorithm. The estimation of the running time is done by using a non-standard measure. The present paper is one of the few examples that employ the Measure & Conquer paradigm of algorithm analysis, developed within the field of Exact Exponential-Time Algorithmics, within the area of Parameterized Algorithmics.