Pages that link to "Item:Q3932299"
From MaRDI portal
The following pages link to Fast, Efficient Parallel Algorithms for Some Graph Problems (Q3932299):
Displaying 30 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- A general program scheme for finding bridges (Q787676) (← links)
- Parallel strong orientation of an undirected graph (Q789182) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- Graph algorithms on a tree-structured parallel computer (Q797290) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- An O(log n) algorithm for parallel update of minimum spanning trees (Q1075769) (← links)
- The parallel complexity of deadlock detection (Q1091805) (← links)
- Finding fundamental cycles and bridges on a tree-structured parallel computer (Q1093373) (← links)
- Fast parallel graph searching with applications (Q1103409) (← links)
- An efficient parallel algorithm for updating minimum spanning trees (Q1105383) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- Parallel algorithms for the connected components and minimal spanning tree problems (Q1162158) (← links)
- Distributed processing of graphs: Fundamental cycles algorithm (Q1186357) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
- A self-stabilizing algorithm for detecting fundamental cycles in a graph (Q1807676) (← links)
- An efficient distributed bridge-finding algorithm (Q1894245) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- Parallel computations on graphs (Q3221400) (← links)
- New fast parallel algorithm for the connected component problem and its VLSI implementation (Q3358233) (← links)
- Equivalence in the complexity of several problems (Q3711747) (← links)
- Parallel algorithms for connectivity problems in graph theory (Q3802645) (← links)
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS (Q4820006) (← links)
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES (Q4820161) (← links)
