Search Sciweavers | Sciweavers

1949 search results - page 11 / 390

» Random graphs on surfaces

Voted

WEA
2005
Springer

154views Algorithms» more WEA 2005»

Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs

15 years 3 months ago

Download www.cs.rpi.edu

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...

Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...

claim paper

Read More »

click to vote

EJC
2008

152views Information Technology» more EJC 2008»

Expansion properties of a random regular graph after random vertex deletions

14 years 9 months ago

Download web.maths.unsw.edu.au

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-...

Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...

claim paper

Read More »

click to vote

RSA
2006

132views more RSA 2006»

Almost universal graphs

14 years 9 months ago

Download www.math.cmu.edu

We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c

Alan M. Frieze, Michael Krivelevich

claim paper