1-page and 2-page drawings with bounded number of crossings per edge
From MaRDI portal
Publication:1678086
DOI10.1016/j.ejc.2017.07.009zbMath1373.05123OpenAlexW2747941151MaRDI QIDQ1678086
Md. Iqbal Hossain, Carla Binucci, Giuseppe Liotta, Emilio Di Giacomo
Publication date: 14 November 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.009
Related Items (10)
Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Parameterized algorithms for book embedding problems ⋮ Local and union page numbers ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Upward Book Embeddings of st-Graphs ⋮ On mixed linear layouts of series-parallel graphs ⋮ On Mixed Linear Layouts of Series-Parallel Graphs
Cites Work
- Unnamed Item
- Parallelisation of genetic algorithms for the 2-page crossing number problem
- Embedding planar graphs in four pages
- The book thickness of a graph
- A partial k-arboretum of graphs with bounded treewidth
- Graph treewidth and geometric thickness parameters
- Area requirement of graph drawings with few crossings per edge
- The 2-page crossing number of \(K_{n}\)
- 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- Minimum-Area Drawings of Plane 3-Trees
- Crossing Minimisation Heuristics for 2-page Drawings
- On the Pagenumber of k-Trees
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Crossing minimization in linear embeddings of graphs
- On the book thickness of $k$-trees
- Drawing Outer 1-planar Graphs with Few Slopes
- The pagenumber of \(k\)-trees is \(O(k)\)
This page was built for publication: 1-page and 2-page drawings with bounded number of crossings per edge
