29 search results - page 1 / 6 » Generating Outerplanar Graphs Uniformly at Random |
CPC
2006
13 years 5 months ago
2006
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...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
JGAA
2007
13 years 4 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
RSA
2008
13 years 4 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...