Multi-level graph layout on the GPU

This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contrib...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 13(2007), 6 vom: 01. Nov., Seite 1310-9
1. Verfasser: Frishman, Yaniv (VerfasserIn)
Weitere Verfasser: Tal, Ayellet
Format: Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM174687265
003 DE-627
005 20231223140454.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0582.xml 
035 |a (DE-627)NLM174687265 
035 |a (NLM)17968079 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Frishman, Yaniv  |e verfasserin  |4 aut 
245 1 0 |a Multi-level graph layout on the GPU 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 14.12.2007 
500 |a Date Revised 30.10.2007 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet Service Provider) networks is presented 
650 4 |a Journal Article 
700 1 |a Tal, Ayellet  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 13(2007), 6 vom: 01. Nov., Seite 1310-9  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:13  |g year:2007  |g number:6  |g day:01  |g month:11  |g pages:1310-9 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 13  |j 2007  |e 6  |b 01  |c 11  |h 1310-9