A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization

DOI10.1007/978-3-642-33090-2_59zbMath1365.68285OpenAlexW1767392647MaRDI QIDQ2912885

Yasuaki Kobayashi, Hisao Tamaki

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_59

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

An FPT algorithm for bipartite vertex splitting ⋮ A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization ⋮ A linear edge kernel for two-layer crossing minimization

This page was built for publication: A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization