Cellular arrays for the solution of graph problems

DOI10.1145/361573.361576zbMath0251.05121OpenAlexW2059889718MaRDI QIDQ5663902

William H. Kautz, Karl N. Levitt

Publication date: 1972

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361573.361576

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

Equivalence in the complexity of several problems ⋮ Determining connected components in linear time by a linear number of processors ⋮ Parallel computations on graphs ⋮ A new approach to parallel computing ⋮ An adaptive and cost-optimal parallel algorithm for minimum spanning trees ⋮ Parallel Algorithms for Network Routing Problems and Recurrences

This page was built for publication: Cellular arrays for the solution of graph problems