Fixed parameter algorithms for one-sided crossing minimization revisited

DOI10.1016/j.jda.2006.12.008zbMath1155.68054OpenAlexW1966697435MaRDI QIDQ935846

Vida Dujmović, Michael Kaufmann, Henning Fernau

Publication date: 8 August 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.12.008

zbMATH Keywords

graph drawingcrossing minimizationparameterized algorithms2-layer drawings\(\mathcal {FPT}\)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Parameterized analysis and crossing minimization problems ⋮ Parameterized approaches to orthogonal compaction ⋮ An FPT algorithm for bipartite vertex splitting ⋮ Drawing (complete) binary tanglegrams ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ Ranking and Drawing in Subexponential Time ⋮ A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization ⋮ Comparing trees via crossing minimization ⋮ A linear edge kernel for two-layer crossing minimization ⋮ Orthogonal planarity testing of bounded treewidth graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge crossings in drawings of bipartite graphs
• A general method to speed up fixed-parameter-tractable algorithms
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• A fixed-parameter approach to 2-layer planarization
• Kernels: Annotated, Proper and Induced
• Graph Drawing

This page was built for publication: Fixed parameter algorithms for one-sided crossing minimization revisited