A direct decomposition of 3-connected planar graphs

FPSAC Proceedings 2005 - 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics

Volumn , Issue , 2005, Pages 459-470

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

^a HUMBOLDT UNIVERSITY   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithms; Planar graphs; Random sampling

Indexed keywords

3-CONNECTED PLANAR GRAPHS; ALGEBRAIC EQUATIONS; CONVEX POLYHEDRONS; DECOMPOSITION STRATEGY; DIRECT DECOMPOSITION; ISOMORPHISM TYPE; PLANAR GRAPH; PLANAR MAPS; POLYNOMIAL-TIME ALGORITHMS; RANDOM SAMPLING;

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

GRAPHIC METHODS;

EID: 84861125771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, and Michèle Soria, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Random Structures and Algorithms 19 (2001), 194-246.
2. E.A. Bender and L.B.Richmond, The asymptotic enumeration of rooted convex polyhedra, Journal of Combinatorial Theory (1984), no. 36, 276-283.
3. Edward A Bender and N.C.Wormald, Almost all convex polyhedra are asymmetric, Can. J. Math. 27 (1985), no. 5, 854-871.
4. M. Bodirsky, C. GrÖpl, andM. Kang, Generating labeled planar graphs uniformly at random, Proceedings of Thirtieth International Colloquium on Automata, Languages and Programming (ICALP'03), 2003, pp. 1095- 1107.
5. -, Sampling unlabeled 2-connected planar graphs uniformly at random, Preprint, 2004.
6. Mireille Bousquet-Mélou, On (some) functional equations arising in enumerative combinatorics, extended abstract for FPSAC'01, 2001.
7. P. Bürgisser, M. Clausen, and M.A. Shokrollahi, Algebraic complexity theory, Grundlehren der mathematischen Wissenschaften, no. 315, Springer Verlag, 1997.
8. Alain Denise and Paul Zimmermann, Uniform random generation of decomposable structures using floatingpoint arithmetic, Theoretical Computer Science 218 (1999), 233-248.
9. Reinhard Diestel, Graph theory, Springer-Verlag, New York, 1997.
10. P.J. Federico, The number of polyhedra, Philips Res. Repts 30 (1975), 220-231.
11. P. Flajolet, P. Zimmerman, and B. Van Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science 132 (1994), no. 1-2, 1-35.
12. Philippe Flajolet and Robert Sedgewick, Analytic combinatorics - symbolic combinatorics, Book in preparation (Oct 2004), and Rapport de recherche 4103, INRIA, 2001.
13. Eric Fusy, Dominique Poulalhon, and Gilles Schaeffer, Dissections and trees: applications to optimal mesh encoding and random sampling, Accepted for publication in the proceedings of SODA'05, 2005.
14. The GNU multiple precision arithmetic library, version 4.1.2., http://swox.com/gmp/.
15. Ian P. Goulden and David M. Jackson, Combinatorial enumeration, John Wiley, New York, 1983.
16. 2 algorithm for determining isomorphism of planar graphs, Information Processing Letters 1 (1971), no. 1, 32-34.
17. V. A. Liskovets and T. R.Walsh, Counting non-isomorphic 2-connected planar maps, Graph Theory Newsletter 9 (1980), no. 6, 3.
18. R.C.Mullin and P.J. Schellenberg, The enumeration of c-nets via quadrangulations, Journal of Combinatorial Theory 4 (1968), 259-276.
19. A. Nijenhuis and H.S. Wilf, Combinatorial algorithms, Academic Press Inc., 1979.
20. Bruno Salvy and Paul Zimmermann, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Transactions on Mathematical Software 20 (1994), no. 2, 163-177.
21. Gilles Schaeffer, Conjugaison d'arbres et cartes combinatoires aléatoires, Ph.D. thesis, Université Bordeaux I, 1998.
22. Gilles Schaeffer, Random sampling of large planar maps and convex polyhedra, Proc. of the thirty-first annual ACM symposium on theory of computing (STOC'99) (Atlanta, Georgia), ACM press, May 1999, pp. 760-769.
23. E. Steinitz, Polyeder und Raumeinteilungen, EncyclopÄdie der mathematischen Wissenschaften 3 (1922), no. 9.
24. W. T. Tutte, A census of planar triangulations, Canad. J. Math. 14 (1962), 21-38.
25. -, A census of planar maps, Canad. J. Math. 15 (1963), 249-271.
26. -, Graph theory, Cambridge University Press, 1984.
27. T. Walsh and V. A. Liskovets, Ten steps to counting planar graphs, Proc. of Eighteenth Southeastern International Conference on Combinatoris, Graph Theory, and Computing, Congr. Numer., 1987, pp. 269-277.
28. Timothy Walsh, Counting non-isomorphic three-connected planar maps, J. Combin. Theory 32 (1982), 33-44.
29. Nicholas C. Wormald, On the number of planar maps, Canad. J. Math. 33 (1981), no. 1, 1-11.