CIAC 2010 - PDF Preprint Papers

CIAC 2010 Italian Conference on Algorithms and Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CIAC-2010 Paper

click to vote

CIAC
2010
Springer

184views Algorithms» more CIAC 2010»

Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

1 years 11 months ago

Download www.cs.uu.nl

In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...

Bart Jansen

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	184	Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights	claim
2	120	Maximizing PageRank with new Backlinks	claim
3	101	The Complexity of Computing Minimal Unidirectional Covering Sets	claim
4	99	A Planar Linear Arboricity Conjecture	claim
5	99	A parameterized algorithm for Chordal Sandwich	claim
6	90	Parameterized Complexity of Even/Odd Subgraph Problems	claim
7	89	Popular matchings in the Marriage and Roommates problems	claim
8	79	Bounding the number of tolerable faults in majority-based systems	claim
9	78	Online Cooperative Cost Sharing	claim
10	75	On the Number of Higher Order Delaunay Triangulations	claim
11	74	Improved Approximations for TSP with Simple Precedence Constraints	claim
12	74	Multicut Algorithms via Tree Decompositions	claim
13	69	Graph unique-maximum and conflict-free colorings	claim
14	65	Enumerating Rooted Graphs with Reflectional Block Structures	claim
15	64	An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences	claim
16	64	On Strategy Improvement Algorithms for Simple Stochastic Games	claim
17	63	Capacitated Confluent Flows: Complexity and Algorithms	claim
18	59	Strategic Coloring of a Graph	claim
19	50	A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers