Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex <inline-formula><tex-math notation="LaTeX">v</tex-math> <inline-graphic xlink:href="chakaravarthy-ieq1-2634535.gif"/> </i...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 28; číslo 7; s. 2031 - 2045
Hlavní autori:	Chakaravarthy, Venkatesan T., Checconi, Fabio, Murali, Prakash, Petrini, Fabrizio, Sabharwal, Yogish
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithm design and analysis Algorithms Apexes Benchmark testing Blogs Communications traffic delta stepping distributed system graph 500 benchmark Graph theory Graphs Load management parallel algorithm Parallel algorithms Pruning Shortest path Shortest-path problems Very large scale integration
ISSN:	1045-9219, 1558-2183
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!