Cellular arrays for the solution of graph problems

DOI10.1145/361573.361576MaRDI QIDQ5663902zbMATH OpenOpenAlexFDO

Authors William H. Kautz, Karl 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

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

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663902)