Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
From MaRDI portal
Recommendations
Cited in
(54)- scientific article; zbMATH DE number 6708339 (Why is no real title available?)
- Parallel algorithms for connectivity problems in graph theory
- Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
- Finding fundamental cycles and bridges on a tree-structured parallel computer
- Parallel algorithms on interval graphs
- An efficient parallel algorithm for updating minimum spanning trees
- scientific article; zbMATH DE number 4033068 (Why is no real title available?)
- Efficient parallel algorithms for graph problems
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
- Computing dominators in parallel
- scientific article; zbMATH DE number 4049080 (Why is no real title available?)
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
- Binary tree algebraic computation and parallel algorithms for simple graphs
- An efficient distributed bridge-finding algorithm
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- scientific article; zbMATH DE number 3930349 (Why is no real title available?)
- scientific article; zbMATH DE number 4068310 (Why is no real title available?)
- Nearly work-efficient parallel algorithm for digraph reachability
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
- Graph theory (algorithmic, algebraic, and metric problems)
- Optimal parallel algorithms on planar graphs
- Parallel graph algorithms for hypercube computers
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- A self-stabilizing algorithm for detecting fundamental cycles in a graph
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
- On the Parallel Evaluation of Dwba Integrals
- Finding Lowest Common Ancestors in Parallel
- scientific article; zbMATH DE number 1102788 (Why is no real title available?)
- scientific article; zbMATH DE number 1985710 (Why is no real title available?)
- On the parallel computation of the biconnected and strongly connected co-components of graphs
- A digraph theoretic parallelism in block methods
- High Parallel Complexity Graphs and Memory-Hard Functions
- Efficient parallel algorithms for permutation graphs
- Parallel search algorithms for graphs and trees
- scientific article; zbMATH DE number 4087453 (Why is no real title available?)
- Distributed processing of graphs: Fundamental cycles algorithm
- Computational Science - ICCS 2004
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Parallel algorithms for P4-comparability graphs
- Designing efficient parallel algorithms on interval graphs
- Graph Problems on a Mesh-Connected Processor Array
- An optimal parallel processor bound in strong orientation of an undirected graph
- scientific article; zbMATH DE number 3972201 (Why is no real title available?)
- scientific article; zbMATH DE number 54593 (Why is no real title available?)
- An O(log n) algorithm for parallel update of minimum spanning trees
- scientific article; zbMATH DE number 4115994 (Why is no real title available?)
- Efficient minimum spanning tree algorithms on the reconfigurable mesh
This page was built for publication: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335006)
