COMBINATORICA 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMBINATORICA-2010 Paper

click to vote

COMBINATORICA
2010

186views Machine Learning» more COMBINATORICA 2010»

Approximation algorithms via contraction decomposition

13 years 7 months ago

Download www-math.mit.edu

We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...

Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...

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	186	Approximation algorithms via contraction decomposition	claim
2	162	Formulae and growth rates of high-dimensional polycubes	claim
3	151	A randomized embedding algorithm for trees	claim
4	147	Online vertex-coloring games in random graphs	claim
5	140	A superadditivity and submultiplicativity property for cardinalities of sumsets	claim
6	137	The three-in-a-tree problem	claim
7	134	The homology of a locally finite graph with ends	claim
8	134	Asymptotic enumeration of integer matrices with large equal row and column sums	claim
9	130	On a poset of trees	claim
10	130	New hook length formulas for binary trees	claim
11	129	Hypergraphs with independent neighborhoods	claim
12	128	Set systems without a simplex or a cluster	claim
13	124	A note on disjoint arborescences	claim
14	121	Every rayless graph has an unfriendly partition	claim
15	119	A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers