Confluent drawing algorithms using rectangular dualization

DOI10.1007/978-3-642-18469-7_31MaRDI QIDQ3073685zbMATH OpenOpenAlexFDO

Authors Gianluca Quercini, Massimo Ancona

Publication date 11 February 2011

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18469-7_31

zbMATH Keywords

orthogonal drawingclustered graphsconfluent drawingrectangular dualization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Graph Drawing
• Biclique Edge Cover Graphs and Confluent Drawings
• Graph Drawing
• Confluent layered drawings

Cited in

(5)

• Strict Confluent Drawing
• The widths of strict outerconfluent graphs
• Confluent layered drawings
• scientific article; zbMATH DE number 5137290 (Why is no real title available?)
• Graph Drawing

This page was built for publication: Confluent drawing algorithms using rectangular dualization

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