Sciweavers

2310 search results - page 35 / 462
» Coloring Random Graphs
Sort
View
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 8 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
LATIN
2000
Springer
14 years 16 days ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito
AML
2004
94views more  AML 2004»
13 years 8 months ago
The cofinality of the saturated uncountable random graph
Assuming CH, let 1 be the saturated random graph of cardinal
Steve Warner
3DIM
2007
IEEE
14 years 3 months ago
Silhouette Extraction with Random Pattern Backgrounds for the Volume Intersection Method
In this paper, we present a novel approach for extracting silhouettes by using a particular pattern that we call the random pattern. The volume intersection method reconstructs th...
Masahiro Toyoura, Masaaki Iiyama, Koh Kakusho, Mic...
RSA
2006
98views more  RSA 2006»
13 years 9 months ago
Levels of a scale-free tree
Consider the random graph model of Barab
Zsolt Katona