Fast parallel graph searching with applications
From MaRDI portal
Recommendations
Cites work
- Algorithms for some graph problems on a distributed computational model
- An 0(log n) parallel algorithm for strong connectivity augmentation problem
- Depth-first search is inherently sequential
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Finding the maximum, merging, and sorting in a parallel computation model
- scientific article; zbMATH DE number 4068310 (Why is no real title available?)
- scientific article; zbMATH DE number 4094808 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3635515 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- Parallel algorithms for a depth first search and a breadth first search
- Parallel breadth-first search algorithms for trees and graphs
- Parallel computation and conflicts in memory access
- Parallel Computations in Graph Theory
- Parallel Matrix and Graph Algorithms
- Prallel algorithms for analyzing activity networks
- The Parallel Evaluation of General Arithmetic Expressions
Cited in
(17)- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
- A unified approach to parallel depth-first traversals of general trees
- Finding maximum matching for bipartite graphs in parallel
- Parallel algorithms for flexible pattern matching on big graphs
- Sequential and parallel solution-biased search for subgraph algorithms
- scientific article; zbMATH DE number 6616702 (Why is no real title available?)
- scientific article; zbMATH DE number 4068310 (Why is no real title available?)
- Fast-mixed searching and related problems on graphs
- Time-work tradeoffs for parallel algorithms
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
- Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
- Shared-memory parallel frontier-based search
- scientific article; zbMATH DE number 5033869 (Why is no real title available?)
- Algorithms for some graph problems on a distributed computational model
- Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
- Distributed graph augmentation protocols to achieve strong connectivity in multi-agent networks
- An adaptive parallel algorithm for analyzing activity networks
This page was built for publication: Fast parallel graph searching with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103409)