Pages that link to "Item:Q1356881"
From MaRDI portal
The following pages link to Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881):
Displaying 14 items.
- An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM (Q676443) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- Parallel strong orientation of an undirected graph (Q789182) (← links)
- The interval-merging problem (Q867634) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← 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)
- Work-efficient parallel union-find with applications to incremental graph connectivity (Q1693229) (← links)
- Concurrent disjoint set union (Q2064053) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (Q3985808) (← links)
- A Simpler Parallel Algorithm for Graph Connectivity (Q4285909) (← links)