Dagview: an approach for visualizing large graphs

DOI10.1007/978-3-642-36763-2_44zbMATH Open1377.68181OpenAlexW1584882887MaRDI QIDQ4912232FDOQ4912232

Ioannis G. Tollis, Evgenios M. Kornaropoulos

Publication date: 3 April 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36763-2_44

Recommendations

• Drawing directed acyclic graphs: an experimental study
• Algorithms and bounds for drawing directed graphs
• Navigating Clustered Graphs Using Force-Directed Methods
• DAGmaps: space filling visualization of directed acyclic graphs
• Graph layout for applications in compiler construction

Mathematics Subject Classification ID

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

Cited In (4)

• Algorithms and Bounds for L-Drawings of Directed Graphs
• Title not available (Why is that?)
• \textit{Clingraph}: ASP-based visualization
• Title not available (Why is that?)

This page was built for publication: Dagview: an approach for visualizing large graphs

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