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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 28; no. 7; pp. 2031 - 2045
Main Authors:	Chakaravarthy, Venkatesan T., Checconi, Fabio, Murali, Prakash, Petrini, Fabrizio, Sabharwal, Yogish
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!