scientific article
From MaRDI portal
Publication:3683547
zbMath0567.68040MaRDI QIDQ3683547
Narsingh Deo, Michael J. Quinn
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyconnected componentsshortest pathsystolic arraysbibliographytraveling salesmanparallel computationparallel algorithmsminimum spanning treesearchingSIMD machinesmaximum cliquemaximum cardinality matchingarray processorsassociative processorsmultiple CPU computers
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
An efficient algorithm for concurrent priority queue heaps ⋮ Some parallel algorithms on interval graphs ⋮ A survey of constrained classification ⋮ Parallel algorithms for shortest path problems in polygons ⋮ Parallel consistent labeling algorithms ⋮ Parallel circle-cover algorithms ⋮ Computation of shortest path in cellular automata ⋮ A linear systolic algorithm for the connected component problem ⋮ A canonical form of vector machines ⋮ Computing minimum spanning forests on 1- and 2-dimensional processor arrays ⋮ An efficient parallel algorithm for the all pairs shortest path problem ⋮ Parallel algorithms on circular-arc graphs ⋮ An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem ⋮ Parallel heap: an optimal parallel priority queue ⋮ On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs ⋮ An adaptive and cost-optimal parallel algorithm for minimum spanning trees ⋮ Optimal vertex ordering of graphs
This page was built for publication:
