Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Social based layouts for the increase of locality in graph operations

Autor
Prat, A.; Dominguez, D.; Larriba, J.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2011
Volum
6587
Pàgina inicial
558
Pàgina final
569
DOI
https://doi.org/10.1007/978-3-642-20149-3_40 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/13533 Obrir en finestra nova
URL
http://www.springerlink.com/content/m681145384508162/ Obrir en finestra nova
Resum
Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy. Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that i...
Citació
Prat, A.; Dominguez, D.; Larriba, J. Social based layouts for the increase of locality in graph operations. "Lecture notes in computer science", 2011, vol. 6587, p. 558-569.
Paraules clau
ALGORITHMS, BANDWIDTH, COMMUNITY STRUCTURE, NETWORKS, community detection, graph mining, performance
Grup de recerca
DAMA-UPC - Data Management Group

Participants

  • Prat Perez, Arnau  (autor)
  • Dominguez Sala, David  (autor)
  • Larriba Pey, Josep  (autor)