An improved fixed-parameter algorithm for one-page crossing minimization
From MaRDI portal
Publication:5111885
Recommendations
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Parameterized algorithms for book embedding problems
- Parameterized algorithms for book embedding problems
Cites work
- scientific article; zbMATH DE number 15256 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- A \(c^k n\) 5-approximation algorithm for treewidth
- Characterizations of outerplanar graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding planar graphs in four pages
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- Graph-Theoretic Concepts in Computer Science
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Monadic second-order evaluations on tree-decomposable graphs
- On circular layouts∗
- On the parameterized complexity of layered graph drawing
- One- and two-page crossing numbers for some types of graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- The book thickness of a graph
- The complexity of first-order and monadic second-order logic revisited
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth. Computations and approximations
Cited in
(9)- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Parameterized algorithms for book embedding problems
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering
- Parameterized algorithms for book embedding problems
- Parameterized analysis and crossing minimization problems
- Parameterized approaches to orthogonal compaction
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
This page was built for publication: An improved fixed-parameter algorithm for one-page crossing minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111885)
