Random planar graphs with n nodes and a fixed number of edges.
Let ℘(n, m) be the class of simple labelled planar graphs with n nodes and m edges, and let Rn,q be a graph drawn uniformly at random from ℘(n, ⌊qn⌋). We show properties that hold with high probability (w.h.p.) for Rn,q when 1 < q < 3. For example, we show that Rn,q contains w.h.p. lin...
Váldodahkkit: | Gerke, S, McDiarmid, C, Steger, A, Weißl, A |
---|---|
Materiálatiipa: | Conference item |
Almmustuhtton: |
SIAM
2005
|
Geahča maid
-
On the Number of Edges in Random Planar Graphs.
Dahkki: Gerke, S, et al.
Almmustuhtton: (2004) -
Random planar graphs
Dahkki: McDiarmid, C, et al.
Almmustuhtton: (2005) -
Random planar graphs.
Dahkki: Mcdiarmid, C, et al.
Almmustuhtton: (2005) -
On the Maximum Degree of a Random Planar Graph.
Dahkki: McDiarmid, C, et al.
Almmustuhtton: (2008) -
Random cubic planar graphs.
Dahkki: Bodirsky, M, et al.
Almmustuhtton: (2007)