Name
Abstract | ||
|---|---|---|
This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and k-connectivity. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1002/rsa.10112 | Random Struct. Algorithms |
Keywords | Field | DocType |
various monotone property,arbitrary dense graph,small diameter,fixed size clique,random edge | Random regular graph,Discrete mathematics,Graph,Combinatorics,Random graph,Clique,Hopcroft–Karp algorithm,Multiple edges,Monotone polygon,Mathematics,Dense graph | Journal |
Volume | Issue | ISSN |
24 | 2 | Random Structures Algorithms 24(2) (2004), 105--117 |
Citations | PageRank | References |
12 | 1.14 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Alan M. Frieze | 2 | 4837 | 787.00 |
| michael krivelevich | 3 | 1688 | 179.90 |
| Ryan Martin | 4 | 144 | 14.43 |