Sciweavers

2 search results - page 1 / 1
» Generation of Symmetric and Asymmetric Biconnected Rooted Ou...
Sort
View
208
Voted
IEICET
2011
15 years 2 months ago
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
Bingbing Zhuang, Hiroshi Nagamochi
188
Voted
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 28 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang