The Parallel Recognition of Classes of Graphs
From MaRDI portal
Publication:3877052
DOI10.1109/TC.1980.1675627zbMath0436.68042MaRDI QIDQ3877052
Publication date: 1980
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
analysis of algorithms; parallel processing; transitive closure; cellular space; parallel cellular algorithms; recognizing adjacency and incidence matrices
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
68Q80: Cellular automata (computational aspects)
Related Items
Determining connected components in linear time by a linear number of processors, Dynamic programming on linear pipelines, Mapping dynamic programming onto modular linear systolic arrays, Parallel computations on graphs