214 search results - page 4 / 43 » Note on Sparse Random Graphs and Cover Graphs |
SIAMCOMP
1998
13 years 7 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
RSA
2006
13 years 7 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
COMBINATORICS
1998
13 years 7 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
COMBINATORICS
2000
13 years 7 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
STOC
2010
ACM
14 years 19 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...