scientific article; zbMATH DE number 3930349
From MaRDI portal
Publication:3703296
Recommendations
- Parallel algorithms for finding connected components of a graph
- scientific article; zbMATH DE number 1057772
- Parallel algorithms for connectivity problems in graph theory
- scientific article; zbMATH DE number 3905859
- A Simpler Parallel Algorithm for Graph Connectivity
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
- scientific article; zbMATH DE number 3972201
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Efficient parallel algorithms for graph problems
- Parallel algorithms for connectivity problems on interval graphs
Cited in
(30)- A faster parallel connectivity algorithm on cographs
- scientific article; zbMATH DE number 5879017 (Why is no real title available?)
- PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
- Parallel algorithms for series parallel graphs
- Optimal parallel algorithms on planar graphs
- Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
- Equivalence in the complexity of several problems
- A faster parallel algorithm for \(k\)-connectivity
- Parallel algorithms for connectivity problems in graph theory
- Computational Science - ICCS 2004
- An optimal parallel co-connectivity algorithm
- Graph Problems on a Mesh-Connected Processor Array
- An Efficient Parallel Biconnectivity Algorithm
- scientific article; zbMATH DE number 6708339 (Why is no real title available?)
- Approximating unweighted connectivity problems in parallel
- scientific article; zbMATH DE number 1985710 (Why is no real title available?)
- Parallel algorithms for P4-comparability graphs
- scientific article; zbMATH DE number 1102788 (Why is no real title available?)
- Simple concurrent labeling algorithms for connected components
- Solving Undirected Graph Problems on VLSI
- Determining connected components in linear time by a linear number of processors
- Parallel Complexity of the Connected Subgraph Problem
- An efficient and fast parallel-connected component algorithm
- An optimal parallel connectivity algorithm
- Connected components and minimum paths
- Parallel algorithms for finding connected components of a graph
- A linear systolic algorithm for the connected component problem
- Parallel computations on a graph
- scientific article; zbMATH DE number 3860407 (Why is no real title available?)
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703296)
