Algorithms for graphs embeddable with few crossings per edge
Publication date
2004
Authors
Grigoriev, A.
Bodlaender, H.L.
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
Keywords
Wiskunde en Informatica (WIIN), Ordered by external client
Citation
Grigoriev, A & Bodlaender, H L 2004, Algorithms for graphs embeddable with few crossings per edge. vol. 2004-058, UU-CS edn, Institute of Information and Computing Sciences, Utrecht, the Netherlands.