Pages that link to "Item:Q3477960"
From MaRDI portal
The following pages link to An efficient and fast parallel-connected component algorithm (Q3477960):
Displaying 22 items.
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- An optimal parallel connectivity algorithm (Q797997) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- Parallel asynchronous connected components in a mesh (Q1178235) (← links)
- I/O- and CPU-optimal recognition of strongly connected components (Q1209333) (← 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)
- Work-efficient parallel union-find with applications to incremental graph connectivity (Q1693229) (← links)
- An optimal parallel co-connectivity algorithm (Q1882536) (← links)
- Estimating the number of connected components in sublinear time (Q2252647) (← links)
- Comparative study and proof of single-pass connected components algorithms (Q2331087) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- Finding strongly connected components in distributed graphs (Q2484293) (← links)
- New fast parallel algorithm for the connected component problem and its VLSI implementation (Q3358233) (← links)
- A Fast Parallel Horner Algorithm (Q3474278) (← links)
- An Efficient Parallel Biconnectivity Algorithm (Q3694710) (← links)
- A Simpler Parallel Algorithm for Graph Connectivity (Q4285909) (← links)
- A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing (Q4612951) (← links)
- Euro-Par 2004 Parallel Processing (Q5311351) (← links)
- Algorithm Theory - SWAT 2004 (Q5315398) (← links)