Pages that link to "Item:Q3867197"
From MaRDI portal
The following pages link to Computing connected components on parallel computers (Q3867197):
Displaying 32 items.
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- Graph algorithms on a tree-structured parallel computer (Q797290) (← links)
- An optimal parallel connectivity algorithm (Q797997) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- A parallel algorithm for the monadic unification problem (Q1083189) (← links)
- Separation and lower bounds for ROM and nondeterministic models of parallel computation (Q1098633) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- A linear systolic algorithm for the connected component problem (Q1123585) (← links)
- Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
- Parallel algorithms for the connected components and minimal spanning tree problems (Q1162158) (← 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 parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Efficient enumeration of all minimal separators in a graph (Q1390866) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Efficient connection processing in equation-based object-oriented models (Q2073116) (← links)
- Fast connected-component labeling (Q2270831) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← 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)
- IMPLEMENTING HIRSCHBERG'S PRAM-ALGORITHM FOR CONNECTED COMPONENTS ON A GLOBAL CELLULAR AUTOMATON (Q3606547) (← links)
- Parallel algorithms on graphs (Q3944000) (← links)
