Crossing Layout in Non-planar Graph Drawings

DOI10.1007/978-981-15-6533-5_11MaRDI QIDQ5001663zbMATH OpenOpenAlexFDO

Authors Martin Nöllenburg

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• 1-bend orthogonal partial edge drawing
• A better heuristic for orthogonal graph drawings
• Biclique Edge Cover Graphs and Confluent Drawings
• Bipartite permutation graphs
• Bundled Crossings in Embedded Graphs
• Bundled crossings revisited
• Complement reducible graphs
• Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Confluent Hasse diagrams
• Confluent layered drawings
• Crossing Number is NP-Complete
• Drawing graphs with right angle crossings
• Edge crossings in drawings of bipartite graphs
• Edges and switches, tunnels and bridges
• Efficient algorithms for integer programs with two variables per constraint.
• Gap-planar graphs
• Graph Drawing
• Graph Drawing
• Handbook of graph drawing and visualization
• Improved Circular Layouts
• Maximizing ink in partial edge drawings of \(k\)-plane graphs
• Notes on large angle crossing graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On strict (outer-)confluent graphs
• Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
• Progress on partial edge drawings
• Slanted orthogonal drawings: model, algorithms and evaluations
• Smooth orthogonal layouts
• Strict Confluent Drawing
• The Bundled Crossing Number
• The graph genus problem is NP-complete
• Train tracks and confluent drawings

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)