{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:45Z","timestamp":1759638825552},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_60","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"593-603","source":"Crossref","is-referenced-by-count":2,"title":["Sampling Unlabeled Biconnected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Gr\u00f6pl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihyun","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/rsa.10021","volume":"19","author":"C. Banderier","year":"2001","unstructured":"Banderier, C., Flajolet, P., Schaeffer, G., Soria, M.: Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Structures and Algorithms\u00a019, 194\u2013246 (2001)","journal-title":"Random Structures and Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Bender, A., Gao, Z., Wormald, N.: The number of labeled 2-connected planar graphs. Electronic Journal of Combinatorics\u00a09(43) (2002)","key":"60_CR2","DOI":"10.37236\/1659"},{"issue":"5","key":"60_CR3","doi-asserted-by":"publisher","first-page":"854","DOI":"10.4153\/CJM-1985-046-0","volume":"27","author":"E.A. Bender","year":"1985","unstructured":"Bender, E.A., Wormald, N.: Almost all convex polyhedra are asymmetric. Can. J. Math.\u00a027(5), 854\u2013871 (1985)","journal-title":"Can. J. Math."},{"doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Gim\u00e9nez, O., Kang, M., Noy, M.: 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, pp. 383\u2013388 (2005)","key":"60_CR4","DOI":"10.46298\/dmtcs.3451"},{"unstructured":"Bodirsky, M., Gr\u00f6pl, C., Johannsen, D., Kang, M.: A direct decomposition of 3-connected planar graphs. In: Proceedings of the 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2005), Taormina (2005)","key":"60_CR5"},{"unstructured":"Bodirsky, M., Gr\u00f6pl, C., Kang, M.: Sampling unlabeled biconnected planar graphs, Full version, available at http:\/\/www.informatik.hu-berlin.de\/Forschung_Lehre\/algorithmen\/en\/forschung\/planar\/","key":"60_CR6"},{"key":"60_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/3-540-45061-0_84","volume-title":"Automata, Languages and Programming","author":"M. Bodirsky","year":"2003","unstructured":"Bodirsky, M., Gr\u00f6pl, C., Kang, M.: Generating labeled planar graphs uniformly at random. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1095\u20131107. Springer, Heidelberg (2003)"},{"unstructured":"Bodirsky, M., Kang, M.: 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 2003 (2003)","key":"60_CR8"},{"doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. In: 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS (2003)","key":"60_CR9","DOI":"10.1007\/3-540-36494-3_44"},{"key":"60_CR10","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"Denise, A., Vasconcellos, M., Welsh, D.: The random planar graph. Congressus Numerantium\u00a0113, 61\u201379 (1996)","journal-title":"Congressus Numerantium"},{"key":"60_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(98)00323-5","volume":"218","author":"A. Denise","year":"1999","unstructured":"Denise, A., Zimmermann, P.: Uniform random generation of decomposable structures using floating-point arithmetic. Theoretical Computer Science\u00a0218, 233\u2013248 (1999)","journal-title":"Theoretical Computer Science"},{"key":"60_CR12","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, New York (1997)"},{"unstructured":"Eric Fusy, D.P., Schaeffer, G.: Dissections and trees: applications to optimal mesh encoding and random sampling. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2005), pp. 690\u2013699 (2005)","key":"60_CR13"},{"issue":"1-2","key":"60_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P. Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmerman, P., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science\u00a0132(1-2), 1\u201335 (1994)","journal-title":"Theoretical Computer Science"},{"key":"60_CR15","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1017\/S0963548303005947","volume":"13","author":"S. Gerke","year":"2004","unstructured":"Gerke, S., McDiarmid, C.: On the number of edges in random planar graphs. Comb. Prob. and Computing\u00a013, 358\u2013402 (2004)","journal-title":"Comb. Prob. and Computing"},{"unstructured":"Gim\u00e9nez, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs (preprint)","key":"60_CR16"},{"doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: Annual ACM Symposium on Theory of Computing, pp. 172\u2013184 (1974)","key":"60_CR17","DOI":"10.1145\/800119.803896"},{"key":"60_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jctb.2004.09.007","volume":"93","author":"C. McDiarmid","year":"2005","unstructured":"McDiarmid, C., Steger, A., Welsh, D.: Random planar graphs. Journal of Combinatorial Theory, Series B\u00a093, 187\u2013205 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"60_CR19","volume-title":"Combinatorial algorithms","author":"A. Nijenhuis","year":"1979","unstructured":"Nijenhuis, A., Wilf, H.: Combinatorial algorithms. Academic Press Inc., London (1979)"},{"doi-asserted-by":"crossref","unstructured":"Osthus, D., Pr\u00f6mel, H.J., Taraz, A.: On random planar graphs, the number of planar graphs and their triangulations. J. Combinatorial Theory, Series B, 119\u2013143 (2003)","key":"60_CR20","DOI":"10.1016\/S0095-8956(02)00040-0"},{"doi-asserted-by":"crossref","unstructured":"Schaeffer, G.: Random sampling of large planar maps and convex polyhedra. In: Proc. of the Thirty-first Annual ACM Symposium on the Theory of Computing (STOC 1999), Atlanta, Georgia, May 1999, pp. 760\u2013769 (1999)","key":"60_CR21","DOI":"10.1145\/301250.301448"},{"unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. Encyclop\u00e4die der mathematischen Wissenschaften\u00a0Band III(9) (1922)","key":"60_CR22"},{"key":"60_CR23","first-page":"226","volume":"51","author":"B.A. Trakhtenbrot","year":"1958","unstructured":"Trakhtenbrot, B.A.: Towards a theory of non-repeating contact schemes. Trudi Mat. Inst. Akad. Nauk SSSR\u00a051, 226\u2013269 (1958) (in Russian)","journal-title":"Trudi Mat. Inst. Akad. Nauk SSSR"},{"key":"60_CR24","volume-title":"Graph Theory","author":"W.T. Tutte","year":"1984","unstructured":"Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (1984)"},{"key":"60_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(82)90072-7","volume":"32","author":"T. Walsh","year":"1982","unstructured":"Walsh, T.: Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory\u00a032, 1\u201311 (1982)","journal-title":"J. Combin. Theory"},{"unstructured":"Walsh, T., Liskovets, V.A.: Ten steps to counting planar graphs. In: 18th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer., vol.\u00a060, pp. 269\u2013277 (1987)","key":"60_CR26"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T18:23:26Z","timestamp":1683311006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11602613_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}