Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21–46 (1996)
Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Comput. 9, 706–712 (1980)
Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. Comput. Geom. Theory and Appl. 10, 29–54 (1998)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
Goldberg, L.A.: Efficient algorithms for listing combinatorial structures. Cambridge University Press, New York (1993)
Knuth, D.E.: The art of computer programming, vol. 4, fascicle 2, generating all tuples and permutations, Addison-Wesley (2005)
Kreher, D.L., Stinson, D.R.: Combinatorial algorithms. CRC Press, Boca Raton (1998)
Li, Z., Nakano, S.: Efficient generation of plane triangulations without repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 433–443. Springer, Heidelberg (2001)
McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26, 306–324 (1998)
Nakano, S.: Efficient generation of triconnected plane triangulations. Comput. Geom. Theory Appl. 27, 109–122 (2004)
Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM SODA, pp. 138–148 (1990)
Stanley, R.P.: Enumerative combinatorics, vol. 1. Cambridge Univ. Press, Cambridge (1997)
Stanley, R.P.: Enumerative combinatorics, vol. 2. Cambridge Univ. Press, Cambridge (1999)
Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput. 15, 540–548 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamanaka, K., Nakano, Si. (2008). Listing All Plane Graphs. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-77891-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77890-5
Online ISBN: 978-3-540-77891-2
eBook Packages: Computer ScienceComputer Science (R0)