A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This report documents the program and outcomes of Dagstuhl Seminar 18241 "High-performance Graph Algorithms". ... The abstracts included in this report contain and survey recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications, both from ... Graph Algorithms 8 2 4 1 8 2 4 1 -High-Performance Graph Algorithms 8 2 4 1 8 2 4 1 -High-Performance Graph Algorithms ...doi:10.4230/dagrep.8.6.19 dblp:journals/dagstuhl-reports/MeyerhenkePS18 fatcat:nbodjldinjgq7eahxl6obpaqie
Our focus lies on modelling techniques and algorithmic primitives that have proven successful in obtaining massive graphs. ... We begin by briefly introducing network features considered by such models, and then discuss random graphs alongside with generation algorithms. ... Acknowledgements We would like to thank the organizers and the staff of the Dagstuhl seminar 18241 on "High-Performance Graph Algorithms" during which the initial idea for this survey was formed. ...arXiv:2003.00736v1 fatcat:pxy6g2qvs5hutbw4qyughe4dk4