Pages that link to "Item:Q3957960"
From MaRDI portal
The following pages link to An O(logn) parallel connectivity algorithm (Q3957960):
Displayed 28 items.
- Concurrent disjoint set union (Q2064053) (← links)
- Fast connected-component labeling (Q2270831) (← links)
- Conditions for swappability of records in a microdata set when some marginals are fixed (Q2271706) (← links)
- Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← 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)
- On the Strongly Connected and Biconnected Components of the Complement of Graphs (Q3439158) (← links)
- An nc algorithm to recognize hhd-free graphs (Q4009712) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
- A simple nc algorithm to recognize weakly triangulated graphs (Q4729374) (← links)
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS (Q4820006) (← links)
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES (Q4820161) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU (Q5066588) (← links)
- Graph Connectivity in Log Steps Using Label Propagation (Q5087066) (← links)
- (Q5091162) (← links)
- Successive approximation in parallel graph algorithms (Q5096155) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- A perfect parallel dictionary (Q5096824) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q5096905) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
- Computation models and function algebras (Q6064278) (← links)
- Efficient parallel modular decomposition (extended abstract) (Q6122232) (← links)
- The parallel complexity of elimination ordering procedures (Q6143979) (← links)
- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality (Q6184389) (← links)