{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:18Z","timestamp":1725487278870},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_84","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"1095-1107","source":"Crossref","is-referenced-by-count":7,"title":["Generating Labeled Planar Graphs Uniformly at Random"],"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","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"84_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-45022-X_33","volume-title":"ICALP\u201900","author":"C. Banderier","year":"2000","unstructured":"C. Banderier, P. Flajolet, G. Schaeffer, and M. Soria. Planar maps and Airy phenomena. In ICALP\u201900, number 1853 in LNCS, pages 388\u2013402, 2000."},{"key":"84_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/rsa.10021","volume":"19","author":"C. Banderier","year":"2001","unstructured":"C. Banderier, P. Flajolet, G. Schaeffer, and M. Soria. Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Structures and Algorithms, 19:194\u2013246, 2001.","journal-title":"Random Structures and Algorithms"},{"key":"84_CR3","unstructured":"A. Bender, Z. Gao, and N. Wormald. The number of labeled 2-connected planar graphs. Preprint, 2000."},{"key":"84_CR4","unstructured":"M. Bodirsky and M. Kang. Generating random outerplanar graphs. Presented at ALICE 03, 2003. Journal version submitted."},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-36494-3_44"},{"key":"84_CR6","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"A. Denise, M. Vasconcellos, and D. Welsh. The random planar graph. Congressus Numerantium, 113:61\u201379, 1996.","journal-title":"Congressus Numerantium"},{"key":"84_CR7","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"R. Diestel. Graph Theory. Springer-Verlag, New York, 1997."},{"key":"84_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/3-540-45465-9_43","volume-title":"ICALP\u2019 02","author":"P. Duchon","year":"2002","unstructured":"P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer. Random sampling from Boltzmann principles. In ICALP\u2019 02, LNCS, pages 501\u2013513, 2002."},{"key":"84_CR9","unstructured":"S. Gerke and C. McDiarmid. On the number of edges in random planar graphs. Submitted."},{"key":"84_CR10","unstructured":"The GNU multiple precision arithmetic library, version 4.1.2. http:\/\/swox.com\/gmp\/."},{"key":"84_CR11","unstructured":"I. K\u00f6thnig. Personal communication. Humboldt-Universit\u00e4t zu Berlin, 2002."},{"key":"84_CR12","unstructured":"C. McDiarmid, A. Steger, and D. J. Welsh. Random planar graphs. Preprint, 2001."},{"key":"84_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0021-9800(68)80007-9","volume":"4","author":"R. Mullin","year":"1968","unstructured":"R. Mullin and P. Schellenberg. The enumeration of c-nets via quadrangulations. Journal of Combinatorial Theory, 4:259\u2013276, 1968.","journal-title":"Journal of Combinatorial Theory"},{"key":"84_CR14","unstructured":"D. Osthus, H. J. Pr\u00f6mel, and A. Taraz. On random planar graphs, the number of planar graphs and their triangulations. Jombinatorial Theory, Series B, to appear."},{"key":"84_CR15","unstructured":"G. Schaeffer. Conjugaison d\u2019arbres et cartes combinatoires al\u00e9atoires. PhD thesis, Universit\u00e9 Bordeaux I, 1998."},{"key":"84_CR16","doi-asserted-by":"crossref","unstructured":"G. Schaeffer. Random sampling of large planar maps and convex polyhedra. In Proc. of the thirty-first annual ACM symposium on theory of computing (STOC\u201999), pages 760\u2013769, Atlanta, Georgia, May 1999. ACM press.","DOI":"10.1145\/301250.301448"},{"key":"84_CR17","unstructured":"G. Schaeffer. Personal communication, 2002."},{"key":"84_CR18","unstructured":"N. J. A. Sloane. The on-line encyclopedia of integer sequences. http:\/\/www.research.att.com\/~njas\/sequences\/index.html, 2002."},{"key":"84_CR19","first-page":"226","volume":"51","author":"B. A. Trakhtenbrot","year":"1958","unstructured":"B. A. Trakhtenbrot. Towards a theory of non-repeating contact schemes. Trudi Mat. Inst. Akad. Nauk SSSR, 51:226\u2013269, 1958. [In Russian].","journal-title":"Trudi Mat. Inst. Akad. Nauk SSSR"},{"key":"84_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.4153\/CJM-1963-029-x","volume":"15","author":"W. Tutte","year":"1963","unstructured":"W. Tutte. A census of planar maps. Canad. J. Math., 15:249\u2013271, 1963.","journal-title":"Canad. J. Math."},{"key":"84_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(82)90072-7","volume":"32","author":"T. Walsh","year":"1982","unstructured":"T. Walsh. Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory, 32:1\u201311, 1982.","journal-title":"J. Combin. Theory"},{"key":"84_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0095-8956(82)90074-0","volume":"32","author":"T. Walsh","year":"1982","unstructured":"T. Walsh. Counting nonisomorphic three-connected planar maps. J. Combin. Theory, 32:33\u201344, 1982.","journal-title":"J. Combin. Theory"},{"key":"84_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0095-8956(82)90073-9","volume":"32","author":"T. Walsh","year":"1982","unstructured":"T. Walsh. Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory, 32:12\u201332, 1982.","journal-title":"J. Combin. Theory"},{"key":"84_CR24","first-page":"269","volume":"60","author":"T. Walsh","year":"1987","unstructured":"T. Walsh and V. A. Liskovets. Ten steps to counting planar graphs. In Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer., volume 60, pages 269\u2013277, 1987.","journal-title":"Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T18:11:18Z","timestamp":1550427078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_84","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}