Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs

DOI10.7155/JGAA.00013MaRDI QIDQ4265499zbMATH OpenOpenAlexFDO

Authors Simone Jannelli, Rossella Petreschi, Tiziana Calamoneri

Publication date 20 October 1999

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/224006

zbMATH Keywords

areabendscrossingscubic graphsgraph drawing algorithms

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 1858605
• Graph Drawing
• An experimental comparison of four graph drawing algorithms.
• An efficient orthogonal grid drawing algorithm for cubic graphs
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• Orthogonally drawing cubic graphs in parallel

Cited in

(6)

• Orthogonally drawing cubic graphs in parallel
• An experimental comparison of four graph drawing algorithms.
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• scientific article; zbMATH DE number 1264876 (Why is no real title available?)
• scientific article; zbMATH DE number 1858605 (Why is no real title available?)
• scientific article; zbMATH DE number 7286697 (Why is no real title available?)

This page was built for publication: Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs

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