Algorithms for graphs embeddable with few crossings per edge

A. Grigoriev, H.L. Bodlaender

Research output: Book/ReportReportAcademic

318 Downloads (Pure)
Original languageEnglish
Place of PublicationUtrecht
PublisherUniversity Utrecht
Number of pages11
EditionUU-CS-2004-058
Publication statusPublished - 1 Jan 2004

Publication series

SeriesComputing Science Technical Report
Number058

Cite this

Grigoriev, A., & Bodlaender, H. L. (2004). Algorithms for graphs embeddable with few crossings per edge. (UU-CS-2004-058 ed.) University Utrecht. Computing Science Technical Report, No. 058