Sampling unlabeled biconnected planar graphs

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationAlgorithms and computation
Place of PublicationBerlin
PublisherSpringer
Pages593-603
Volume3827
ISBN (Print)3-540-30935-7
DOIs
Publication statusPublished - 2005
EventInternational Symposium on Algorithms and Computation - Sanya, Hainan, China
Duration: 19 Dec 200521 Dec 2005

Publication series

NameLecture notes in computer science
PublisherSpringer

Conference

ConferenceInternational Symposium on Algorithms and Computation
CountryChina
CitySanya, Hainan
Period19/12/0521/12/05

Fields of Expertise

  • Sonstiges

Cite this

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