A Fast Multi-Scale Method for Drawing Large Graphs

A Fast Multi-Scale Method for Drawing Large Graphs (2002)

by David Harel , Yehuda Koren

Venue:	JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
Citations:	68 - 10 self

User correction supplied by mph

Datum	Value	Source
TITLE	A Fast Multi-Scale Method for Drawing Large Graphs	user correction
AUTHOR NAME	David Harel	user correction
AUTHOR AFFIL	Dept. of Computer Science and Applied Mathematics; The Weizmann Institute of Science	user correction
AUTHOR ADDR	Rehovot, Israel	user correction
AUTHOR NAME	Yehuda Koren	user correction
AUTHOR AFFIL	Dept. of Computer Science and Applied Mathematics; The Weizmann Institute of Science	user correction
AUTHOR ADDR	Rehovot, Israel	user correction
ABSTRACT	We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawing of a graph with over 15,000 vertices. Also we achieve "nice" drawings of 1000 vertex graphs in about 1 second. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which was motivated by the earlier multi-scale algorithm of Hadany and Harel [HH99]. In principle, it could significantly improve the speed of essentially any force-directed method (regardless of that method's ability of drawing weighted graphs or the continuity of its cost-function).	user correction - Legacy Corrections
YEAR	2002	user correction
VENUE	JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS	user correction
PAGES	179--202	user correction
VOLUME	6	INFERENCE
NUMBER	3	user correction
CITATIONS	21 found	ParsCit 1.0