scientific article; zbMATH DE number 1858605

DOI10.1002/1097-024X(200009)30:11%3C1235::AID-SPE339%3E3.0.CO;2-BMaRDI QIDQ4789076zbMATH OpenWikidataFDO

Authors Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu, Luca Vismara

Publication date 23 January 2003

zbMATH Keywords

graph drawingexperimentsdiagram layout

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An experimental comparison of four graph drawing algorithms.
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
• Graph Drawing
• An Experimental Study on Distance-Based Graph Drawing

Cites work

• scientific article; zbMATH DE number 764413 (Why is no real title available?)
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A better heuristic for orthogonal graph drawings
• A unified approach to visibility representations of planar graphs
• Algorithms for area-efficient orthogonal drawing
• Algorithms for drawing graphs: An annotated bibliography
• Algorithms for plane representations of acyclic digraphs
• An algorithm for drawing general undirected graphs
• An experimental comparison of four graph drawing algorithms.
• Area requirement and symmetry display of planar upward drawings
• Constrained visibility representations of graphs
• Crossing Number is NP-Complete
• DAG—a program that draws directed graphs
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
• Edge crossings in drawings of bipartite graphs
• Experiments on drawing 2-level hierarchical graphs
• HOW TO DRAW A SERIES-PARALLEL DIGRAPH
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Upward planarity testing

Cited in

(13)

• An Experimental Study on Distance-Based Graph Drawing
• Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
• scientific article; zbMATH DE number 2080083 (Why is no real title available?)
• Experimental analysis of the accessibility of drawings with few segments
• Overloaded orthogonal drawings
• A healthy critical attitude: revisiting the results of a graph drawing study
• Topology-driven force-directed algorithms
• scientific article; zbMATH DE number 1982181 (Why is no real title available?)
• Drawing directed acyclic graphs: an experimental study
• Graph drawing through the lens of a framework for analyzing visualization methods (invited talk, extended abstract)
• Sketched graph drawing: a lesson in empirical studies
• An experimental comparison of four graph drawing algorithms.
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication:

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