Strict confluent drawing

DOI10.1007/978-3-319-03841-4_31MaRDI QIDQ2867672zbMATH OpenOpenAlexFDO

Authors David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek

Publication date 20 December 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03841-4_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Strict Confluent Drawing
• On strict (outer-)confluent graphs
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Graph Drawing
• Graph Drawing

Cited in

(7)

• Graph Drawing
• Strict Confluent Drawing
• On strict (outer-)confluent graphs
• On strict (outer-)confluent graphs
• The Bundled Crossing Number
• Train tracks and confluent drawings
• Graph Drawing

This page was built for publication: Strict confluent drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867672)