Skip to main navigation Skip to search Skip to main content

Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions

  • extern

Research output: Book/ReportReportAcademic

Original languageUndefined/Unknown
Place of Publicationonbekend
PublisherUU WINFI Informatica en Informatiekunde
VolumeCS-UU-2006-006
Publication statusPublished - 2006

Bibliographical note

145b

Cite this