Parameterized algorithms for fixed-order book drawing with few crossings per edge
DOI10.1142/S0129054123500168zbMATH Open1543.0514MaRDI QIDQ6569894FDOQ6569894
Authors: Jingui Huang, Jie Chen, Yunlong Liu, Guang Xiao, Jianxin Wang 
Publication date: 9 July 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Parameterized algorithms for book embedding problems
- Parameterized algorithms for book embedding problems
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Fundamentals of parameterized complexity
- The Complexity of Coloring Circular Arcs and Chords
- Improved upper bounds for vertex cover
- Area requirement of graph drawings with few crossings per edge
- Algorithms for graphs embeddable with few crossings per edge
- The vertex separation number of a graph equals its path-width
- Algorithms for the fixed linear crossing number problem
- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
- Crossing minimization in linear embeddings of graphs
- Title not available (Why is that?)
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- 1-page and 2-page drawings with bounded number of crossings per edge
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Experimental evaluation of book drawing algorithms
- Approximating the fixed linear crossing number
- Parameterized algorithms for queue layouts
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Parameterized algorithms for book embedding problems
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Exact crossing number parameterized by vertex cover
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- On 3D visibility representations of graphs with few crossings per edge
- An analysis of some linear graph layout heuristics
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
This page was built for publication: Parameterized algorithms for fixed-order book drawing with few crossings per edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569894)
