Paper Info
Title
A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization.
Abstract
Graphs in the computer science are widely used in social network analysis, computer networks, transportation networks, and many other areas. In general, they can visualize relationships between objects. However, fast drawing of graphs with readable layouts is still a challenge. This paper aims to the speed up the original Fruchterman-Reingold graph layout algorithm by computing repulsive forces only between vertices that are near each other. A new approach based on the selected space-filling curves is described.
Year
DOI
Venue
2014
10.1007/978-3-319-07995-0_2
INTERNATIONAL JOINT CONFERENCE SOCO'14-CISIS'14-ICEUTE'14
Keywords
Field
DocType
graph layouts,space-filling curves,nearest neighbors,Fruchterman-Reingold,fast graph visualization
Graph,Vertex (geometry),Computer science,Visualization,Social network analysis,Theoretical computer science,Speedup,Graph Layout
Conference
Volume
ISSN
Citations 
299
2194-5357
2
PageRank 
References 
Authors
0.41
16
4
Name
Order
Citations
PageRank
Tomás Jezowicz191.75
Petr Gajdos28622.42
Eliška Ochodková3307.54
Václav Snasel41261210.53