Algorithms for graphs embedable with few crossings per egde

A. Grigoriev, H.L. Bodlaender

Research output: Working paper / PreprintWorking paper

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

Publication series

SeriesMETEOR Research Memorandum

Cite this