Algorithms for graphs embeddable with few crossings per edge

DOI10.1007/s00453-007-0010-xzbMath1131.68120WikidataQ30053231 ScholiaQ30053231MaRDI QIDQ2461632

Hans L. Bodlaender, Alexander Grigoriev

Publication date: 28 November 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17980

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms