688 search results - page 36 / 138 » General Partitioning on Random Graphs |
87
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
128
click to vote
COMBINATORICA
2010
14 years 7 months ago
2010
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...
119
Voted
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
111
click to vote
COMBINATORICA
2006
15 years 13 days ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
126
click to vote
ICALP
2009
Springer
16 years 20 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...