Sampling unlabeled biconnected planar graphs

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Original language	English
Title of host publication	Algorithms and computation
Place of Publication	Berlin
Publisher	Springer
Pages	593-603
Volume	3827
ISBN (Print)	3-540-30935-7
DOIs	https://doi.org/10.1007/11602613_60
Publication status	Published - 2005
Event	International Symposium on Algorithms and Computation - Sanya, Hainan, China Duration: 19 Dec 2005 → 21 Dec 2005

Name	Lecture notes in computer science
Publisher	Springer

Conference	International Symposium on Algorithms and Computation
Country	China
City	Sanya, Hainan
Period	19/12/05 → 21/12/05

Bodirsky, M., Gröpl, C., & Kang, M. (2005). Sampling unlabeled biconnected planar graphs. In Algorithms and computation (Vol. 3827, pp. 593-603). (Lecture notes in computer science). Berlin: Springer. https://doi.org/10.1007/11602613_60

@inproceedings{ace26d750aa440f880bbe74def3cb3a2,

title = "Sampling unlabeled biconnected planar graphs",

author = "Manuel Bodirsky and Clemens Gr{\"o}pl and Mihyun Kang",

year = "2005",

doi = "10.1007/11602613_60",

language = "English",

isbn = "3-540-30935-7",

volume = "3827",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "593--603",

booktitle = "Algorithms and computation",

}