A tighter insertion-based approximation of the crossing number

DOI10.1007/978-3-642-22006-7_11MaRDI QIDQ6827957zbMATH OpenFDO

Authors Markus Chimani, Petr Hliněný

Publication date 6 July 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10)

This page was built for publication: A tighter insertion-based approximation of the crossing number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827957)