ICALP
2003
Springer
13 years 9 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...