Pages that link to "Item:Q3945594"
From MaRDI portal
The following pages link to Efficient parallel algorithms for some graph problems (Q3945594):
Displayed 29 items.
- Algorithms for some graph problems on a distributed computational model (Q580985) (← links)
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← 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)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- An optimal parallel processor bound in strong orientation of an undirected graph (Q1062459) (← links)
- Finding fundamental cycles and bridges on a tree-structured parallel computer (Q1093373) (← links)
- On handling vertex deletion in updating minimum spanning trees (Q1104108) (← 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)
- Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory (Q1178193) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← 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)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← 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)
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)