A parallel algorithm for constructing minimum spanning trees
From MaRDI portal
Publication:3875355
DOI10.1016/0196-6774(80)90004-8zbMATH Open0435.68049OpenAlexW2012667106MaRDI QIDQ3875355FDOQ3875355
Authors: Jon Bentley 
Publication date: 1980
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(80)90004-8
Cited In (16)
- Finding fundamental cycles and bridges on a tree-structured parallel computer
- An Event-Driven Algorithm for Agents on the Web
- Synchronization coherence: a transparent hardware mechanism for cache coherence and fine-grained synchronization
- A model of sequential computation with Pipelined access to memory
- A fully distributed (minimal) spanning tree algorithm
- Parallel algorithms for the single source shortest path problem
- Parallel algorithm for analysing activity networks on a tree-structured computer
- An introduction to parallelism in combinatorial optimization
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- A massively parallel algorithm based on DNA computations for constructing minimal spanning trees
- An O(N log N) minimal spanning tree algorithm for N points in the plane
- Unbounded hardware is equivalent to deterministic Turing machines
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Computing with pipelined block transfer
- Graph algorithms on a tree-structured parallel computer
- Parallel computations on graphs
This page was built for publication: A parallel algorithm for constructing minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875355)
