Crossing Layout in Non-planar Graph Drawings
From MaRDI portal
Publication:5001663
DOI10.1007/978-981-15-6533-5_11OpenAlexW3089802901MaRDI QIDQ5001663
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_11
Related Items (4)
An annotated review on graph drawing and its applications ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Improved scheduling of morphing edge drawing ⋮ Block crossings in one-sided tanglegrams
Cites Work
- Unnamed Item
- Unnamed Item
- Drawing graphs with right angle crossings
- Confluent layered drawings
- Train tracks and confluent drawings
- Edges and switches, tunnels and bridges
- Bipartite permutation graphs
- Complement reducible graphs
- Edge crossings in drawings of bipartite graphs
- A better heuristic for orthogonal graph drawings
- 1-fan-bundle-planar drawings of graphs
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
- Gap-planar graphs
- Bundled crossings revisited
- On strict (outer-)confluent graphs
- Maximizing ink in partial edge drawings of \(k\)-plane graphs
- Bundled Crossings in Embedded Graphs
- Smooth Orthogonal Layouts
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
- Slanted Orthogonal Drawings: Model, Algorithms and Evaluations
- The Bundled Crossing Number
- Strict Confluent Drawing
- The graph genus problem is NP-complete
- Crossing Number is NP-Complete
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Improved Circular Layouts
- Biclique Edge Cover Graphs and Confluent Drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Progress on Partial Edge Drawings
- 1-Bend Orthogonal Partial Edge Drawing
- Notes on large angle crossing graphs
- Graph Drawing
- Confluent Hasse Diagrams
- Graph Drawing
- Efficient algorithms for integer programs with two variables per constraint.
This page was built for publication: Crossing Layout in Non-planar Graph Drawings
