Sciweavers

COMBINATORICS
2007
77views more  COMBINATORICS 2007»
14 years 15 days ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
CPC
2006
93views more  CPC 2006»
14 years 16 days ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang