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...
Κύριοι συγγραφείς: | Gerke, S, McDiarmid, C, Steger, A, Weißl, A |
---|---|
Μορφή: | Conference item |
Έκδοση: |
SIAM
2005
|
Παρόμοια τεκμήρια
-
On the Number of Edges in Random Planar Graphs.
ανά: Gerke, S, κ.ά.
Έκδοση: (2004) -
Random planar graphs
ανά: McDiarmid, C, κ.ά.
Έκδοση: (2005) -
Random planar graphs.
ανά: Mcdiarmid, C, κ.ά.
Έκδοση: (2005) -
On the Maximum Degree of a Random Planar Graph.
ανά: McDiarmid, C, κ.ά.
Έκδοση: (2008) -
Random cubic planar graphs.
ανά: Bodirsky, M, κ.ά.
Έκδοση: (2007)