Sampling unlabeled biconnected planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 593-603

  Bodirsky, Manuel ^a   Gröpl, Clemens ^b   Kang, Mihyun ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; RANDOM PROCESSES; SAMPLING;

AUTOMORPHISM; BICONNECTED PLANAR GRAPHS; CONNECTIVITY STRUCTURE; POLYNOMIAL TIME ALGORITHM;

GRAPH THEORY;

EID: 33744957662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_60     Document Type: Conference Paper

References (26)

1. C. Banderier, P. Flajolet, G. Schaeffer, and M. Soria. Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Structures and Algorithms, 19:194-246, 2001.
2. A. Bender, Z. Gao, and N. Wormald. The number of labeled 2-connected planar graphs. Electronic Journal of Combinatorics, 9(43), 2002.
3. E. A. Bender and N. Wormald. Almost all convex polyhedra are asymmetric. Can. J. Math., 27(5):854-871, 1985.
4. M. Bodirsky, O. Giménez, M. Kang, and M. Noy. On the number of series-parallel and outerplanar graphs. In the Proceedings of European Conference on Combinatorics, Graph Theory, and Applications (EuroComb 2005), DMTCS Proceedings Series Volume AE, pages 383 - 388, 2005.
5. M. Bodirsky, C. Gröpl, D. Johannsen, and M. Kang. A direct decomposition of 3-connected planar graphs. In Proceedings of the 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC05), Taormina, 2005.
6. M. Bodirsky, C. Gröpl, and M. Kang. Sampling unlabeled biconnected planar graphs. Full version, available at http://www.informatik.hu-berlin.de/Forschung_Lehre/algorithmen/en/forschung/ planar/.
7. M. Bodirsky, C. Gröpl, and M. Kang. Generating labeled planar graphs uniformly at random. In Thirtieth International Colloquium on Automata, Languages and Programming (ICALP'03), pages 1095-1107, 2003.
8. M. Bodirsky and M. Kang. Generating outerplanar graphs uniformly at random. Accepted for publication in Combinatorics, Probability and Computing. Presented at the 1st workshop on Algorithms for Listing, Counting, and Enumeration (ALICE 03), 2003.
9. N. Bonichon, C. Gavoille, and N. Hanusse. An information-theoretic upper bound of planar graphs using triangulation. In In 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2003.
10. A. Denise, M. Vasconcellos, and D. Welsh. The random planar graph. Congressus Numerantium, 113:61-79, 1996.
11. A. Denise and P. Zimmermann. Uniform random generation of decomposable structures using floating-point arithmetic. Theoretical Computer Science, 218:233-248, 1999.
12. R. Diestel. Graph Theory. Springer-Verlag, New York, 1997.
13. D. P. Eric Fusy and G. Schaeffer. Dissections and trees: applications to optimal mesh encoding and random sampling. In Proceedings of the sixteenth annual ACMSIAM symposium on Discrete algorithms (SODA05), pages 690 - 699, 2005.
14. P. Flajolet, P. Zimmerman, and B. Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1-2):1-35, 1994.
15. S. Gerke and C. McDiarmid. On the number of edges in random planar graphs. Comb. Prob, and Computing, 13:358-402, 2004.
16. O. Giménez and M. Noy. Asymptotic enumeration and limit laws of planar graphs, preprint.
17. J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomorphism of planar graphs. Annual ACM Symposium on Theory of Computing, pages 172-184, 1974.
18. C. McDiarmid, A. Steger, and D. Welsh. Random planar graphs. Journal of Combinatorial Theory, Series B, 93:187-205, 2005.
19. A. Nijenhuis and H. Wilf. Combinatorial algorithms. Academic Press Inc., 1979.
20. D. Osthus, H. J. Prömel, and A. Taraz. On random planar graphs, the number of planar graphs and their triangulations. J. Combinatorial Theory, Series B, pages 119-143, 2003.
21. G. Schaeffer. Rajidom sampling of large planar maps and convex polyhedra. In Proc. of the Thirty-first Annual ACM Symposium on the Theory of Computing (STOC'99), pages 760-769, Atlanta, Georgia, May 1999.
22. E. Steinitz. Polyeder und Raumeinteilungen. Encyclopëdie der mathematischen Wissenschaften, Band 111(9), 1922.
23. B. A. Trakhtenbrot. Towards a theory of non-repeating contact schemes. Trudi Mat. Inst. Akad. Nauk SSSR, 51:226-269, 1958. [In Russian].
24. W. T. Tutte. Graph Theory. Cambridge University Press, 1984.
25. T. Walsh. Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory, 32:1-11, 1982.
26. T. Walsh and V. A. Liskovets. Ten steps to counting planar graphs. In 18th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer., volume 60, pages 269-277, 1987.