On the public citation graph

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

https://doi.org/10.1109/ipdps.2014.96

0 signed · 74 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230090304openalex-snapshot

A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees

inferredcites →https://doi.org/10.1007/978-3-540-77220-0_21openalex-snapshot

Accelerating Large Graph Algorithms on the GPU Using CUDA

inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot

A note on two problems in connexion with graphs

inferredcites →https://doi.org/10.1007/bf02523680openalex-snapshot

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

inferredcites →https://doi.org/10.1016/j.parco.2011.02.004openalex-snapshot

MapReduce in MPI for Large-scale graph algorithms

inferredcites →https://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot

Δ-stepping: a parallelizable shortest path algorithm

inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot

A faster algorithm for betweenness centrality*

inferredcites →https://doi.org/10.1090/dimacs/074/09openalex-snapshot

Single-source shortest paths with the parallel boost graph library

inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot

On a routing problem

inferredcites →https://doi.org/10.1109/icpp.2006.34openalex-snapshot

Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2

inferredcites →https://doi.org/10.1109/icpp.2009.60openalex-snapshot

Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm

inferredcites →https://doi.org/10.1109/ipps.1997.580979openalex-snapshot

A parallel priority data structure with applications

inferredcites →https://doi.org/10.1109/mm.2011.108openalex-snapshot

The IBM Blue Gene/Q Compute Chip

inferredcites →https://doi.org/10.1109/mm.2011.96openalex-snapshot

The IBM Blue Gene/Q Interconnection Fabric

inferredcites →https://doi.org/10.1109/sc.2012.25openalex-snapshot

Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines

inferredcites →https://doi.org/10.1109/sc.2012.50openalex-snapshot

Direction-optimizing Breadth-First Search

inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot

R-MAT: A Recursive Model for Graph Mining

inferredcites →https://doi.org/10.1137/1.9781611972870.3openalex-snapshot

An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances

inferredcites →https://doi.org/10.1145/2063384.2063419openalex-snapshot

The IBM Blue Gene/Q interconnection network and message unit

inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot

Fibonacci heaps and their uses in improved network optimization algorithms

inferredcites →https://doi.org/10.1145/316542.316548openalex-snapshot

Undirected single-source shortest paths with positive integer weights in linear time

inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot

Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

inferredcites →https://doi.org/10.2307/3033543openalex-snapshot

A Set of Measures of Centrality Based on Betweenness

inferredcites →https://doi.org/10.48550/arxiv.0812.4905openalex-snapshot

Kronecker Graphs: An Approach to Modeling Networks

inferredcites →https://doi.org/10.5555/1756006.1756039openalex-snapshot

Kronecker Graphs: An Approach to Modeling Networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-13705-2_8openalex-snapshot

Parallel Shortest Path Big Data Graph Computations of US Road Network Using Apache Spark: Survey, Architecture, and Evaluation

inferred← citeshttps://doi.org/10.1007/978-3-030-22475-2_3openalex-snapshot

Distributed Single-Source Shortest Path Algorithms with Two-Dimensional Graph Layout

inferred← citeshttps://doi.org/10.1007/978-3-030-38991-8_14openalex-snapshot

Impromptu Rendezvous Based Multi-threaded Algorithm for Shortest Lagrangian Path Problem on Road Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-20891-1_9openalex-snapshot

A Multi-Threading Algorithm for Constrained Path Optimization Problem on Road Networks

inferred← citeshttps://doi.org/10.1007/978-3-032-06751-7_16openalex-snapshot

Calculating the Optimal Number of Parallel Processes for Data-Parallel Algorithm Optimization

inferred← citeshttps://doi.org/10.1007/978-3-319-67074-4_15openalex-snapshot

An Efficient Parallel Method for Performing Concurrent Operations on Social Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-90287-6_10openalex-snapshot

An Efficient Parallel Method for Optimizing Concurrent Operations on Social Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-94180-6_30openalex-snapshot

Parallel Shortest Path Graph Computations of United States Road Network Data on Apache Spark

inferred← citeshttps://doi.org/10.1007/978-981-13-3441-2_2openalex-snapshot

Scalable Single-Source Shortest Path Algorithms on Distributed Memory Systems

inferred← citeshttps://doi.org/10.1007/s00607-018-0621-xopenalex-snapshot

A parallel bio-inspried shortest path algorithm

inferred← citeshttps://doi.org/10.1016/b978-0-12-803738-6.00007-0openalex-snapshot

Graph algorithms on GPUs

inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006237openalex-snapshot

Engineering a Parallel Δ-stepping Algorithm

inferred← citeshttps://doi.org/10.1109/cluster52292.2023.00024openalex-snapshot

Communication-Avoiding Recursive Aggregation

inferred← citeshttps://doi.org/10.1109/hipc.2018.00015openalex-snapshot

Synchronization-Avoiding Graph Algorithms

inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237065openalex-snapshot

Fast and scalable NUMA-based thread parallel breadth-first search

inferred← citeshttps://doi.org/10.1109/hpec49654.2021.9622824openalex-snapshot

Delayed Asynchronous Iterative Graph Algorithms

inferred← citeshttps://doi.org/10.1109/ia335182.2014.10612687openalex-snapshot

Distributed Control: Priority Scheduling for Single Source Shortest Paths Without Synchronization

inferred← citeshttps://doi.org/10.1109/icpads.2015.90openalex-snapshot

Comparison of Single Source Shortest Path Algorithms on Two Recent Asynchronous Many-task Runtime Systems

inferred← citeshttps://doi.org/10.1109/icpp.2017.58openalex-snapshot

Parallel Algorithm for Single-Source Earliest-Arrival Problem in Temporal Graphs

inferred← citeshttps://doi.org/10.1109/iiswc.2015.13openalex-snapshot

Performance Characterization of High-Level Programming Models for GPU Graph Analytics

inferred← citeshttps://doi.org/10.1109/ipdps.2015.54openalex-snapshot

High-Performance Graph Analytics on Manycore Processors

inferred← citeshttps://doi.org/10.1109/ipdps.2015.59openalex-snapshot

Scalable Community Detection with the Louvain Algorithm

inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.164openalex-snapshot

Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations

inferred← citeshttps://doi.org/10.1109/kbei.2017.8324901openalex-snapshot

Efficient implementation of the Bellman-Ford algorithm on GPU

inferred← citeshttps://doi.org/10.1109/pic53636.2021.9687040openalex-snapshot

Dijkstra Algorithm Based Building Evacuation Edge Computing and IoT System Design and Implementation

inferred← citeshttps://doi.org/10.1109/sc41404.2022.00050openalex-snapshot

GraphFly: Efficient Asynchronous Streaming Graphs Processing via Dependency-Flow

inferred← citeshttps://doi.org/10.1109/tcsii.2015.2505998openalex-snapshot

An FPGA Implementation for Solving the Large Single-Source-Shortest-Path Problem

inferred← citeshttps://doi.org/10.1109/tpds.2015.2485994openalex-snapshot

An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures

inferred← citeshttps://doi.org/10.1145/2807591.2807661openalex-snapshot

Exploring network optimizations for large-scale graph analytics

inferred← citeshttps://doi.org/10.1145/2851141.2851183openalex-snapshot

DSMR

inferred← citeshttps://doi.org/10.1145/2925426.2926287openalex-snapshot

DSMR

inferred← citeshttps://doi.org/10.1145/2929908.2929917openalex-snapshot

Context Matters

inferred← citeshttps://doi.org/10.1145/3006299.3006321openalex-snapshot

Optimizing the shortest path query on large-scale dynamic directed graph

inferred← citeshttps://doi.org/10.1145/3016078.2851183openalex-snapshot

DSMR

inferred← citeshttps://doi.org/10.1145/3078597.3078616openalex-snapshot

To Push or To Pull

inferred← citeshttps://doi.org/10.1145/3287921.3287981openalex-snapshot

An Efficient Parallel Algorithm for Computing the Closeness Centrality in Social Networks

inferred← citeshttps://doi.org/10.1145/3581784.3607103openalex-snapshot

Embracing Irregular Parallelism in HPC with YGM

inferred← citeshttps://doi.org/10.1145/3694966openalex-snapshot

A Survey of Distributed Graph Algorithms on Massive Graphs

inferred← citeshttps://doi.org/10.14778/3632093.3632094openalex-snapshot

RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing

inferred← citeshttps://doi.org/10.17762/turcomat.v12i3.1823openalex-snapshot

Secure and Shortest Path Routing Bypassing Attackers in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.32657/10356/152573openalex-snapshot

Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques

inferred← citeshttps://doi.org/10.32657/10356/72409openalex-snapshot

Optimized GPU algorithms for sparse data problems

inferred← citeshttps://doi.org/10.48550/arxiv.1507.06702openalex-snapshot

The Anatomy of Large-Scale Distributed Graph Algorithms

inferred← citeshttps://doi.org/10.48550/arxiv.1701.00503openalex-snapshot

Distributed Graph Layout for Scalable Small-world Network Analysis

inferred← citeshttps://doi.org/10.48550/arxiv.1711.00231openalex-snapshot

Dynamic Load Balancing Strategies for Graph Applications on GPUs

inferred← citeshttps://doi.org/10.48550/arxiv.2010.16012openalex-snapshot

To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations

inferred← citeshttps://doi.org/10.55011/staiqc.2023.3101openalex-snapshot

Systematic Literature Review on Parallel Sorting and Searching Algorithms for Graph Analytics Problems

inferred← citeshttps://doi.org/10.5555/2688283.2688286openalex-snapshot

Distributed control: priority scheduling for single source shortest paths without synchronization

inferred← citeshttps://doi.org/10.5815/ijcnis.2020.03.02openalex-snapshot

MapReduce Algorithm for Single Source Shortest Path Problem

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.