Parallel Computations in Graph Theory

DOI10.1137/0207020MaRDI QIDQ4154064zbMATH OpenOpenAlexFDO

Authors Eshrat Reghbati, Derek G. 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

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

Cited in

(17)

• Randomized parallel algorithms
• A unified approach to parallel depth-first traversals of general trees
• Fast parallel graph searching with applications
• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• A parallel algorithm for surface-based object reconstruction
• 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
• Traversing graphs in a paging environment, BFS or DFS?
• New fast parallel algorithm for the connected component problem and its VLSI implementation
• Parallel search algorithms for graphs and trees
• Breadth-first traversal of trees and integer sorting in parallel
• Parallel breadth-first search algorithms for trees and graphs
• A new distributed depth-first-search algorithm
• A parallel search algorithm for directed acyclic graphs
• Algorithms for some graph problems on a distributed computational model
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations

This page was built for publication: Parallel Computations in Graph Theory

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