Skip to main content

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

Abstract

We survey several planar graph generators that were selected according to availability, theoretical interest, easiness of implementation and efficiency. We experimentally study graph properties that allow for a basic classification of the generators. This analysis is extended by means of advanced algorithmical behavior on the generated graphs, in particular kernelization of fixed-parameter tractable problems. We will see the major influence of instance selection on algorithmic behavior. This selection has been disregarded in several publications, which deduce general results from non-representative data sets. Altogether, this study helps experimenters to carefully select sets of planar graphs that allow for a meaningful interpretation of their results.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alber, J., Betzler, N., Niedermeier, R.: Experiments on data reduction for optimal domination in networks. Annals of Operations Research 146(1), 105–117 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alber, J., Dorn, F., Niedermeier, R.: Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics 145(2), 219–231 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alber, J., Fan, H., Fellows, M.R., Fernau, H., Niedermeier, R., Rosamond, F., Stege, U.: A refined search tree technique for dominating set on planar graphs. Journal of Computer and System Sciences 71(4), 385–405 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alber, J., Fellows, M.R., Niedermeier, R.: Efficient data reduction for dominating set: a linear problem kernel for the planar case. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 150–159. Springer, Heidelberg (2002), http://theinf1.informatik.uni-jena.de/publications/swat02.pdf

    Chapter  Google Scholar 

  5. Bodirsky, M., Gröpl, C., Kang, M.: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3), 377–386 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Boros, E., Hammer, P.L., Tavares, G.: Preprocessing of unconstrained quadratic binary optimization. Technical report, Rutgers Center for Operations Research, RUTCOR (2006)

    Google Scholar 

  7. Bowen, R., Fisk, S.: Generations of triangulations of the sphere. Mathematics of Computation 21(98), 250–252 (1967)

    MathSciNet  MATH  Google Scholar 

  8. Denise, A., Vasconcellos, M., Welsh, D.J.A.: The random planar graph. Congressus Numerantium 113, 61–79 (1996)

    MathSciNet  MATH  Google Scholar 

  9. Dillencourt, M.B.: Realizability of delaunay triangulations. Inf. Process. Lett. 33, 283–287 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing 13(4-5), 577–625 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fusy, É.: Implementation of a boltzman sampler for planar graphs (2005), http://www.lix.polytechnique.fr/~fusy/Programs/BoltzmannPlanarGraphs.tar.gz

  12. Fusy, É.: Uniform random sampling of planar graphs in linear time. Random Structures & Algorithms 35(4), 464–522 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Giminéz, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. Journal of the American Mathematical Society (2008)

    Google Scholar 

  14. Brinkmann, G., McKay, B.: Fast generation of planar graphs, http://cs.anu.edu.au/~bdm/papers/plantri-full.pdf

  15. Helden, G.: Hamiltonicity of maximal planar graphs and planar triangulations. Ph.d. thesis, RWTH Aachen (2007)

    Google Scholar 

  16. Mehlhorn, K., Näher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  17. Meinert, S., Wagner, D.: An Experimental Study on Generating Planar Graphs. Technical report, ITI Wagner, Faculty of Informatics, Karlsruhe Institute of Technology (2011)

    Google Scholar 

  18. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

  19. Schank, T., Wagner, D.: Approximating Clustering Coefficient and Transitivity. Journal of Graph Algorithms and Applications 9(2), 265–275 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Seidman, S.B.: Network Structure and Minimum Degree. Social Networks 5, 269–287 (1983)

    Article  MathSciNet  Google Scholar 

  21. van Dijk, T., van den Heuvel, J.-P., Slob, W.: Computing treewidth with LibTW (2006), http://www.treewidth.com/docs/LibTW.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinert, S., Wagner, D. (2011). An Experimental Study on Generating Planar Graphs. In: Atallah, M., Li, XY., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 6681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21204-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21204-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21203-1

  • Online ISBN: 978-3-642-21204-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics