Parallel Computations in Graph Theory

DOI10.1137/0207020zbMath0375.68026OpenAlexW2024760761MaRDI QIDQ4154064

Eshrat Reghbati, Derek Gordon Corneil

Publication date: 1978

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0207020

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items

A new class of parallel algorithms for finding connected components on machines with bit-vector operations, Fast parallel graph searching with applications, A random NC algorithm for depth first search, Parallel algorithms for the single source shortest path problem, A constant-time parallel algorithm for computing convex hulls, An 0(log n) parallel algorithm for strong connectivity augmentation problem, A unified approach to parallel depth-first traversals of general trees, Breadth-first traversal of trees and integer sorting in parallel, Parallel breadth-first search algorithms for trees and graphs, Parallel search algorithms for graphs and trees, A parallel algorithm for surface-based object reconstruction, Algorithms for some graph problems on a distributed computational model, New fast parallel algorithm for the connected component problem and its VLSI implementation, Traversing graphs in a paging environment, BFS or DFS?, A parallel search algorithm for directed acyclic graphs, A new distributed depth-first-search algorithm