An efficient fixed parameter tractable algorithm for 1-sided crossing minimization

DOI10.1007/3-540-36151-0_12MaRDI QIDQ4422268zbMATH OpenFDO

Authors Vida Dujmović, Sue Whitesides

Publication date 3 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280118.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• Fixed parameter algorithms for one-sided crossing minimization revisited
• Graph Drawing
• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
• Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
• A faster fixed parameter algorithm for two-layer crossing minimization
• The constrained crossing minimization problem -- a first approach
• One sided crossing minimization is NP-hard for sparse graphs

Cited in

(10)

• On the one-sided crossing minimization in a bipartite graph with large degrees
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
• A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• scientific article; zbMATH DE number 7525513 (Why is no real title available?)
• Graph Drawing
• Quantum algorithms for one-sided crossing minimization
• Quantum algorithms for one-sided crossing minimization
• Fixed parameter algorithms for one-sided crossing minimization revisited

This page was built for publication: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization

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