The following pages link to (Q3140396):
Displaying 9 items.
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← 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)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- An unambiguous class possessing a complete set (Q5048936) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q5096905) (← links)