IWPEC 2009 - PDF Preprint Papers

IWPEC 2009 International Workshop on Parameterized and Exact Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IWPEC-2009 Paper

click to vote

IWPEC
2009
Springer

226views Applied Computing» more IWPEC 2009»

An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

13 years 11 months ago

Download faculty.cs.tamu.edu

Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to ﬁnd a spanning tree with as many leaves as possible. When parameterized in the number of leav...

Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	226	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem	claim
2	144	Partitioning into Sets of Bounded Cardinality	claim
3	142	Planar Capacitated Dominating Set Is W[1]-Hard	claim
4	134	What Makes Equitable Connected Partition Easy	claim
5	134	On the Directed Degree-Preserving Spanning Tree Problem	claim
6	134	Boolean-Width of Graphs	claim
7	133	An Exponential Time 2-Approximation Algorithm for Bandwidth	claim
8	131	Stable Assignment with Couples: Parameterized Complexity and Local Search	claim
9	130	Improved Parameterized Algorithms for the Kemeny Aggregation Problem	claim
10	119	Balanced Hashing, Color Coding and Approximate Counting	claim
11	118	A Probabilistic Approach to Problems Parameterized above or below Tight Bounds	claim
12	118	Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover	claim
13	116	The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension	claim
14	111	Even Faster Algorithm for Set Splitting!	claim
15	108	On Digraph Width Measures in Parameterized Algorithmics	claim
16	103	Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs	claim
17	103	Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms	claim
18	99	Improved Induced Matchings in Sparse Graphs	claim
19	92	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers