Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
DOI10.1137/0213036zbMATH Open0545.68060OpenAlexW2004090025MaRDI QIDQ3335006FDOQ3335006
Authors: Yung H. Tsin, Francis Y. L. Chin 
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/152217
Recommendations
analysis of algorithmsgraph algorithmsparallel computationPRAMlowest common ancestorsfundamental cyclesbiconnected componentsefficient parallel algorithmsSIMD machinesdirected spanning forestsbridge- connected componentsseparation vertices
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (54)
- Nearly work-efficient parallel algorithm for digraph reachability
- Parallel algorithms for connectivity problems in graph theory
- Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
- Parallel algorithms on interval graphs
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
- Title not available (Why is that?)
- Finding fundamental cycles and bridges on a tree-structured parallel computer
- An efficient parallel algorithm for updating minimum spanning trees
- Efficient parallel algorithms for graph problems
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- Computing dominators in parallel
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
- Title not available (Why is that?)
- 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
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient distributed bridge-finding algorithm
- 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
- 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
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- Finding Lowest Common Ancestors in Parallel
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Computational Science - ICCS 2004
- Distributed processing of graphs: Fundamental cycles algorithm
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Parallel algorithms for P4-comparability graphs
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An O(log n) algorithm for parallel update of minimum spanning trees
- Efficient minimum spanning tree algorithms on the reconfigurable mesh
- Title not available (Why is that?)
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)
