Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Frontiers in Algorithmics

FAW 2010: Frontiers in Algorithmics pp 113–123Cite as

Constant Time Generation of Biconnected Rooted Plane Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6213))

Abstract

A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. In a rooted plane graph, an outer (directed) edge is designated as the root. For a given positive integer n ≥ 1, we give an O(1)-time delay algorithm that enumerates all plane graphs with exactly n vertices using O(n) space. Our algorithm can generates only plane graphs such that the size of each inner face is bounded from above by a prescribed integer g ≥ 3 in the same time and space complexity.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM Journal on Computing 9, 706–712 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fujiwara, H., Wang, J., Zhao, L., Nagamochi, H., Akutsu, T.: Enumerating tree-like chemical graphs with given path frequency. Journal of Chemical Information and Modeling 48, 1345–1357 (2008)

    Article  Google Scholar 

  3. Goldberg, L.A.: Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, New York (1993)

    Book  MATH  Google Scholar 

  4. Hall, L.H., Dailey, E.S.: Design of molecules from quantitative structure-activity relationship models. 3. role of higher order path counts: path 3. J. Chem. Inf. Comp. Sci. 33, 598–603 (1993)

    Article  Google Scholar 

  5. Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: STOC 1974, pp. 172–184 (1974)

    Google Scholar 

  6. Horváth, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proc. 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 197–206 (2006)

    Google Scholar 

  7. Imada, T., Ota, S., Nagamochi, H., Akutsu, T.: Enumerating stereoisomers of tree structured molecules using dynamic programming. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 14–23. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T.: Improved algorithm for enumerating tree-like chemical graphs. In: The 19th International Conference on Genome Informatics, Gold Coast, Australia, December 1- 3 (2008); Genome Informatics 21, 53-64 (2008)

    Google Scholar 

  9. Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms. CRC Press, Boca Raton (1998)

    MATH  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Li, G., Ruskey, F.: The advantage of forward thinking in generating rooted and free trees. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 939–940 (1999)

    Google Scholar 

  12. Mauser, H., Stahl, M.: Chemical fragment spaces for de novo design. J. Chem. Inf. Comp. Sci. 47, 318–324 (2007)

    Article  Google Scholar 

  13. McKay, B.D.: Isomorph-free exhaustive generation. J. of Algorithms 26, 306–324 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nakano, S.: Efficient generation of plane trees. Information Processing Letters 84, 167–172 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nakano, S.: Efficient generation of triconnected plane triangulations. Computational Geometry Theory and Applications 27(2), 109–122 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)

    Google Scholar 

  17. Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 249–260. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Read, R.C.: How to avoid isomorphism search when cataloguing combinatorial configurations. Annals of Discrete Mathematics 2, 107–120 (1978)

    Article  MATH  Google Scholar 

  19. Wilf, H.S.: Combinatorial Algorithms: An Update. SIAM, Philadelphia (1989)

    Book  MATH  Google Scholar 

  20. Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput. 15, 540–548 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yamanaka, K., Nakano, S.: Listing all plane graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 210–221. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Zhuang, B., Nagamochi, H.: Enumerating rooted biconnected planar graphs with internally triangulated faces, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2009-018 (2009), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical~report/TR2009-018.pdf

  23. Zhuang, B., Nagamochi, H.: Enumerating biconnected rooted plane graphs, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2010-001 (2010), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical~report/TR2010-001.pdf

Download references

Author information

Authors and Affiliations

  1. Graduate School of Informatics, Kyoto University, Japan

    Bingbing Zhuang & Hiroshi Nagamochi

Authors
  1. Bingbing Zhuang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Academia Sinica, Institute of Information Science 20, Section 2, 128 Academia Road, Nankang, 11529, Taipei, Taiwan

    Der-Tsai Lee

  2. Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA

    Danny Z. Chen

  3. State Key Laboratory of Software Engineering, Wuhan University, 430072, Wuhan, Hubei, China

    Shi Ying

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhuang, B., Nagamochi, H. (2010). Constant Time Generation of Biconnected Rooted Plane Graphs. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14553-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14552-0

  • Online ISBN: 978-3-642-14553-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation