A multi-scale algorithm for drawing graphs nicely

DOI10.1016/S0166-218X(00)00389-9zbMath0981.68122MaRDI QIDQ5948958

David Harel, Ronny Hadany

Publication date: 18 March 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

straight line edge convention

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A multi-dimensional approach to force-directed layouts of large graphs ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ An annotated review on graph drawing and its applications ⋮ A Distributed Multilevel Force-Directed Algorithm ⋮ Multi-level graph drawing using infomap clustering ⋮ The Turing Test for Graph Drawing Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multilevel computations of integral transforms and particle interactions with oscillatory kernels
• An algorithm for drawing general undirected graphs
• How to Draw a Graph

This page was built for publication: A multi-scale algorithm for drawing graphs nicely