Crossing Layout in Non-planar Graph Drawings
From MaRDI portal
Publication:5001663
DOI10.1007/978-981-15-6533-5_11OpenAlexW3089802901MaRDI QIDQ5001663FDOQ5001663
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
Cites Work
- Complement reducible graphs
- Efficient algorithms for integer programs with two variables per constraint.
- Bipartite permutation graphs
- Crossing Number is NP-Complete
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Improved Circular Layouts
- Confluent layered drawings
- The graph genus problem is NP-complete
- Title not available (Why is that?)
- Drawing graphs with right angle crossings
- A better heuristic for orthogonal graph drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Title not available (Why is that?)
- Notes on large angle crossing graphs
- Graph Drawing
- Edge crossings in drawings of bipartite graphs
- The Bundled Crossing Number
- Graph Drawing
- Train tracks and confluent drawings
- Edges and switches, tunnels and bridges
- On strict (outer-)confluent graphs
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- 1-Bend Orthogonal Partial Edge Drawing
- 1-fan-bundle-planar drawings of graphs
- Bundled Crossings in Embedded Graphs
- Smooth orthogonal layouts
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
- Gap-planar graphs
- Progress on Partial Edge Drawings
- Bundled crossings revisited
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
- Maximizing ink in partial edge drawings of \(k\)-plane graphs
- Strict Confluent Drawing
- Confluent Hasse diagrams
- Biclique Edge Cover Graphs and Confluent Drawings
- Slanted Orthogonal Drawings: Model, Algorithms and Evaluations
Cited In (9)
- Crossing minimization in extended level drawings of graphs
- An annotated review on graph drawing and its applications
- Planarizing graphs and their drawings by vertex splitting
- Planar Crossovers
- Improved scheduling of morphing edge drawing
- Block crossings in one-sided tanglegrams
- Block Crossings in Storyline Visualizations
- Crossing Minimization in Storyline Visualization
- Crossing-constrained hierarchical drawings
This page was built for publication: Crossing Layout in Non-planar Graph Drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001663)
