Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1123.68145OpenAlexW2491671784MaRDI QIDQ5492943

Alexander Grigoriev, Hans L. Bodlaender

Publication date: 20 October 2006

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

Full work available at URL: https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Configurations with few crossings in topological graphs ⋮ A branch-and-cut approach to the crossing number problem

This page was built for publication: Fundamentals of Computation Theory