Algorithms for some graph problems on a distributed computational model
DOI10.1016/0020-0255(87)90039-9zbMATH Open0626.68050OpenAlexW2071155722MaRDI QIDQ580985FDOQ580985
Publication date: 1987
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(87)90039-9
Recommendations
complexity measuresdistributed algorithmscommunication complexitytime complexitygraph problemsnetwork model of computation
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- A new distributed depth-first-search algorithm
- Graph Problems on a Mesh-Connected Processor Array
- Parallel Matrix and Graph Algorithms
- Parallel algorithms for the single source shortest path problem
- Efficient parallel algorithms for some graph problems
- Parallel Computations in Graph Theory
Cited In (10)
- Graph Labelings Derived from Models in Distributed Computing
- Derivation of a distributed algorithm for finding paths in directed networks
- Fast parallel graph searching with applications
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Title not available (Why is that?)
- An efficient distributed bridge-finding algorithm
- On the complexity of distributed graph coloring with local minimality constraints
- Distributed processing of graphs: Fundamental cycles algorithm
- Title not available (Why is that?)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
This page was built for publication: Algorithms for some graph problems on a distributed computational model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580985)
