1542 search results - page 34 / 309 » The metamathematics of random graphs |
104
click to vote
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
CPC
2002
14 years 9 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
EJC
2008
14 years 9 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...