On the public citation graph
Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency
0 signed · 91 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1023/a:1004676705907openalex-snapshot
Parallel Asynchronous Algorithms for the K Shortest Paths 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/mspec.2011.5676366openalex-snapshot
Better benchmarking for supercomputers
inferredcites →https://doi.org/10.1109/pact.2009.22openalex-snapshot
Memory Performance and Cache Coherency Effects on an Intel Nehalem Multiprocessor System
inferredcites →https://doi.org/10.1109/pact.2011.14openalex-snapshot
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
inferredcites →https://doi.org/10.1109/sc.2005.4openalex-snapshot
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
inferredcites →https://doi.org/10.1109/sc.2010.34openalex-snapshot
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
inferredcites →https://doi.org/10.1109/sc.2010.46openalex-snapshot
Scalable Graph Exploration on Multicore Processors
inferredcites →https://doi.org/10.1109/tpds.2007.70811openalex-snapshot
Efficient Breadth-First Search on the Cell/BE Processor
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1519065.1519089openalex-snapshot
User interactions in social networks and their implications
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/1810479.1810534openalex-snapshot
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
inferredcites →https://doi.org/10.1145/1837274.1837289openalex-snapshot
An effective GPU implementation of breadth-first search
inferredcites →https://doi.org/10.1145/1941553.1941590openalex-snapshot
Accelerating CUDA graph algorithms at maximum warp
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/2717511openalex-snapshot
High-Performance and Scalable GPU Graph Traversal
inferredcites →https://doi.org/10.1609/icaps.v20i1.13414openalex-snapshot
Perfect Hashing for State Space Exploration on the GPU
inferredcites →https://doi.org/10.48550/arxiv.1104.4518openalex-snapshot
Parallel Breadth-First Search on Distributed Memory Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.8119openalex-snapshot
An OpenMP‐based breadth‐first search implementation using the bag data structure
inferred← citeshttps://doi.org/10.1007/978-1-4614-8745-6_7openalex-snapshot
A Parallel Algorithm to Solve Near-Shortest Path Problems on Raster Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07518-1_8openalex-snapshot
Sparsifying Synchronization for High-Performance Shared-Memory Sparse Triangular Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-29817-7_6openalex-snapshot
Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-6721-5_4openalex-snapshot
A Multi-source Graph Traversal Algorithm for Social Network Graphs Inspired by The Combing Operation of Armed Forces
inferred← citeshttps://doi.org/10.1007/s10115-023-01899-2openalex-snapshot
Accelerating massive queries of approximate nearest neighbor search on high-dimensional data
inferred← citeshttps://doi.org/10.1007/s11227-018-2525-0openalex-snapshot
An adaptive breadth-first search algorithm on integrated architectures
inferred← citeshttps://doi.org/10.1007/s11390-019-1936-6openalex-snapshot
Cacheap: Portable and Collaborative I/O Optimization for Graph Processing
inferred← citeshttps://doi.org/10.1016/j.future.2019.02.024openalex-snapshot
MCA-V2I: A Multi-hop Clustering Approach over Vehicle-to-Internet communication for improving VANETs performances
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.11.006openalex-snapshot
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.05.007openalex-snapshot
Designing and implementing a heuristic cross-architecture combination for graph traversal
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.09.007openalex-snapshot
Accelerating breadth-first graph search on a single server by dynamic edge trimming
inferred← citeshttps://doi.org/10.1109/ccgrid.2013.85openalex-snapshot
A Scalable Implementation of a MapReduce-based Graph Processing Algorithm for Large-Scale Heterogeneous Supercomputers
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.93openalex-snapshot
Characterizing MPI and Hybrid MPI+Threads Applications at Scale: Case Study with BFS
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799125openalex-snapshot
Work efficient parallel algorithms for large graph exploration
inferred← citeshttps://doi.org/10.1109/hipc.2016.043openalex-snapshot
Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality
inferred← citeshttps://doi.org/10.1109/hipc.2018.00017openalex-snapshot
Expediting Parallel Graph Connectivity Algorithms
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.150openalex-snapshot
Direction-Optimizing Breadth-First Search on CPU-GPU Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1109/hpec62836.2024.10938483openalex-snapshot
Parallel Online Directed Acyclic Graph Exploration for Atlasing Soft-Matter Assembly Configuration Spaces
inferred← citeshttps://doi.org/10.1109/icaccct.2014.7019232openalex-snapshot
Modified path traversal for an efficient web navigation mining
inferred← citeshttps://doi.org/10.1109/iccd53106.2021.00057openalex-snapshot
Empirical Guide to Use of Persistent Memory for Large-Scale In-Memory Graph Analysis
inferred← citeshttps://doi.org/10.1109/icpp.2014.16openalex-snapshot
Designing a Heuristic Cross-Architecture Combination for Breadth-First Search
inferred← citeshttps://doi.org/10.1109/icppw.2014.44openalex-snapshot
Delivering Parallel Programmability to the Masses via the Intel MIC Ecosystem: A Case Study
inferred← citeshttps://doi.org/10.1109/iiswc.2015.12openalex-snapshot
Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server
inferred← citeshttps://doi.org/10.1109/ipdps.2013.37openalex-snapshot
On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest
inferred← citeshttps://doi.org/10.1109/ipdps.2014.64openalex-snapshot
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
inferred← citeshttps://doi.org/10.1109/ipdps.2016.71openalex-snapshot
FastBFS: Fast Breadth-First Graph Search on a Single Server
inferred← citeshttps://doi.org/10.1109/ipdps.2017.53openalex-snapshot
Scalable Graph Traversal on Sunway TaihuLight with Ten Million Cores
inferred← citeshttps://doi.org/10.1109/ipdps.2017.85openalex-snapshot
The Reverse Cuthill-McKee Algorithm in Distributed-Memory
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00037openalex-snapshot
GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.197openalex-snapshot
Using MIC to Accelerate a Typical Data-Intensive Application: The Breadth-first Search
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.241openalex-snapshot
Avoiding Locks and Atomic Instructions in Shared-Memory Parallel BFS Using Optimistic Parallelization
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.48openalex-snapshot
Breadth-First Search with A Multi-Core Computer
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.78openalex-snapshot
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00094openalex-snapshot
Highly Efficient and GPU-Friendly Implementation of BFS on Single-node System
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644918openalex-snapshot
Concurrent Hybrid Breadth-First-Search on Distributed PowerGraph for Skewed Graphs
inferred← citeshttps://doi.org/10.1109/sc.2012.50openalex-snapshot
Direction-optimizing Breadth-First Search
inferred← citeshttps://doi.org/10.1109/sc.2012.70openalex-snapshot
Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing
inferred← citeshttps://doi.org/10.1109/sc.companion.2012.139openalex-snapshot
Analysis and Optimization of Financial Analytics Benchmark on Modern Multi- and Many-core IA-Based Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2015.2407896openalex-snapshot
Suitability Analysis of FPGAs for Heterogeneous Platforms in HPC
inferred← citeshttps://doi.org/10.1109/tsmc.2019.2961378openalex-snapshot
Novel Fast Networking Approaches Mining Underlying Structures From Investment Big Data
inferred← citeshttps://doi.org/10.1145/2535753.2535755openalex-snapshot
The energy case for graph processing on hybrid CPU and GPU systems
inferred← citeshttps://doi.org/10.1145/2588555.2610518openalex-snapshot
Navigating the maze of graph analytics frameworks using massive graph datasets
inferred← citeshttps://doi.org/10.1145/2688500.2688522openalex-snapshot
MPI+Threads: runtime contention and remedies
inferred← citeshttps://doi.org/10.1145/2717511openalex-snapshot
High-Performance and Scalable GPU Graph Traversal
inferred← citeshttps://doi.org/10.1145/2755573.2755580openalex-snapshot
Branch-Avoiding Graph Algorithms
inferred← citeshttps://doi.org/10.1145/2807591.2807651openalex-snapshot
A work-efficient algorithm for parallel unordered depth-first search
inferred← citeshttps://doi.org/10.1145/2818950.2818982openalex-snapshot
Instruction Offloading with HMC 2.0 Standard
inferred← citeshttps://doi.org/10.1145/2830772.2830774openalex-snapshot
Exploiting commutativity to reduce the cost of updates to shared data in cache-coherent systems
inferred← citeshttps://doi.org/10.1145/2858788.2688522openalex-snapshot
MPI+Threads: runtime contention and remedies
inferred← citeshttps://doi.org/10.1145/3390523openalex-snapshot
A Conflict-free Scheduler for High-performance Graph Processing on Multi-pipeline FPGAs
inferred← citeshttps://doi.org/10.1155/2013/702694openalex-snapshot
Direction-Optimizing Breadth-First Search
inferred← citeshttps://doi.org/10.1177/1094342014524240openalex-snapshot
Using the Intel Many Integrated Core to accelerate graph traversal
inferred← citeshttps://doi.org/10.14288/1.0167209openalex-snapshot
Accelerating irregular applications on parallel hybrid platforms
inferred← citeshttps://doi.org/10.4018/978-1-5225-3799-1.ch003openalex-snapshot
Accelerated Network Traversal Using Multi/Many-Cores
inferred← citeshttps://doi.org/10.4018/978-1-5225-3799-1.ch004openalex-snapshot
Partitioning of Complex Networks for Heterogeneous Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3018openalex-snapshot
Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04826openalex-snapshot
Optimizations to the Parallel Breath First Search on Distributed Memory
inferred← citeshttps://doi.org/10.5555/2388996.2389015openalex-snapshot
Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
inferred← citeshttps://doi.org/10.5753/wscad.2021.18507openalex-snapshot
Uma implementação da busca em largura com estrutura bag e OpenMP
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.