Algorithms for graphs embedable with few crossings per egde

A. Grigoriev, H.L. Bodlaender

Research output: Working paperProfessional

1567 Downloads (Pure)
Original languageEnglish
Place of PublicationMaastricht
PublisherMETEOR, Maastricht University School of Business and Economics
Number of pages4
DOIs
Publication statusPublished - 1 Jan 2004

Publication series

SeriesMETEOR Research Memorandum
Number035

Cite this

Grigoriev, A., & Bodlaender, H. L. (2004). Algorithms for graphs embedable with few crossings per egde. METEOR, Maastricht University School of Business and Economics. METEOR Research Memorandum, No. 035 https://doi.org/10.26481/umamet.2004035