scientific article
From MaRDI portal
Publication:3140396
zbMath0801.68123MaRDI QIDQ3140396
Publication date: 15 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (9)
An optimal EREW PRAM algorithm for minimum spanning tree verification ⋮ An unambiguous class possessing a complete set ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems ⋮ Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM ⋮ Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM ⋮ Efficient enumeration of all minimal separators in a graph ⋮ Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems ⋮ Static and dynamic parallel computation of connected components
This page was built for publication: