Parallel computations on graphs

DOI10.1007/BF01068475zbMath0557.68031MaRDI QIDQ3221400

Evgeniĭ Alekseevich Ivanov, V. P. Shevchenko

Publication date: 1984

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

surveyparallel algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (1)

Graph theory (algorithmic, algebraic, and metric problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel algorithms for the connected components and minimal spanning tree problems
• Parallel computation and conflicts in memory access
• Computing connected components on parallel computers
• A parallel algorithm for constructing minimum spanning trees
• Parallel computations in linear algebra
• The Parallel Recognition of Classes of Graphs
• Parallel Matrix and Graph Algorithms
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Efficient parallel algorithms for some graph problems
• Parallel Algorithms in Graph Theory: Planarity Testing
• An O(logn) parallel connectivity algorithm
• Complexity problems in computational theory
• New Parallel-Sorting Schemes
• Cellular arrays for the solution of graph problems

This page was built for publication: Parallel computations on graphs