A parallel Fruchterman–Reingold algorithm optimized for fast visualization of large graphs and swarms of data
Authors:
- Petr GajdošPGPetr Gajdoš
- Tomáš JežowiczTJTomáš Ježowicz
- Vojtěch UherVUVojtěch Uher
- Pavel DohnálekPDPavel Dohnálek
- 1 February 2016
- journal article
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 26, 56-63
Abstract
No abstract availableKeywords
Funding Information
- “Parallel processing of Big data 2” of the Student Grant System (SP2015/146)
- GAČR (P103/15/06700S)
This publication has 18 references indexed in Scilit:
- Visualization of Large Graphs Using GPU Computing2013
- Approximate all nearest neighbor search for high dimensional entropy estimation for image registrationSignal Processing, 2012
- Ant Colony Optimization2011
- Fast construction of k-nearest neighbor graphs for point cloudsIEEE Transactions on Visualization and Computer Graphics, 2010
- Prosima: Protein similarity algorithm2009
- Rapid Multipole Graph Drawing on the GPU2009
- Multi-Level Graph Layout on the GPUIEEE Transactions on Visualization and Computer Graphics, 2007
- Metrics for Functional and Aesthetic Label Layouts2005
- Which aesthetic has the greatest effect on human understanding?1997
- An algorithm for drawing general undirected graphsInformation Processing Letters, 1989