Listing All Plane Graphs
In this paper we give a simple algorithm to generate all connected rooted plane graphs with at most m edges. A “rooted” plane graph is a plane graph with one designated (directed) edge on the outer face. The algorithm uses O(m) space and generates such graphs in O(1) time per graph on average without duplications. The algorithm does not output the entire graph but the difference from the previous graph. By modifying the algorithm we can generate all connected (non-rooted) plane graphs with at most m edges in O(m 3) time per graph.
Unable to display preview. Download preview PDF.
- 6.Knuth, D.E.: The art of computer programming, vol. 4, fascicle 2, generating all tuples and permutations, Addison-Wesley (2005)Google Scholar
- 7.Kreher, D.L., Stinson, D.R.: Combinatorial algorithms. CRC Press, Boca Raton (1998)Google Scholar
- 11.Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM SODA, pp. 138–148 (1990)Google Scholar
- 13.Stanley, R.P.: Enumerative combinatorics, vol. 2. Cambridge Univ. Press, Cambridge (1999)Google Scholar