We show how to generate labelled and unlabelled outerplanar graphs with n vertices uniformly at random in polynomial time in n.

Apr 7, 2006 · We show how to generate labelled and unlabelled outerplanar graphs with $n$ vertices uniformly at random in polynomial time in $n$.

A counting technique using the decomposition of a graph according to its block structure is presented, and the exact number of labelled and unlabelled ...

Oct 22, 2024 · We show how to generate labelled and unlabelled outerplanar graphs with n vertices uniformly at random in polynomial time in n.

Generating Graphs Uniformly at Random. This paper deals with the problem of sampling from a uniform distribution on various classes of graphs of given size.

We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at random. Our approach uses recursive formulae for the ...

Mar 2, 2021 · There are well-defined methods for generating random graphs / networks that satisfy certain properties, including small-world graphs, scale-free ...

Abstract: We show how to generate labelled and unlabelled outerplanar graphs with $n$ vertices uniformly at random in polynomial time in $n$.

There are no such simple formulas known for general outerplanar graphs. In this paper we show how to efficiently generate random labeled outerplanar graphs.

We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at random. Our approach uses recursive formulae for the ...