Minimal spanning trees: An empirical investigation of parallel algorithms-Reference-Cited by-同舟云学术

Minimal spanning trees: An empirical investigation of parallel algorithms

Published:1989-10 Issue:1 Volume:12 Page:45-52
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Barr R.S,Helgaon R.V,Kennington J.L

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference19 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. An adaptive and cost-optimal parallel algorithm for minimum spanning trees;Akl;Computing,1986

3. The asymmetric M-traveling salesman problem: A duality based branch-and-bound algorithm;Ali;Discrete Appl. Math.,1986

4. Graph Theory: An Algorithmic Approach;Christofides,1975

5. Parallel algorithms for the minimum spanning tree problem;Deo,1981

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Topology optimization for blockchain networks;2024 36th Chinese Control and Decision Conference (CCDC);2024-05-25

2. UAVs assisted Network Partition Detection and Connectivity Restoration in Wireless Sensor and Actor Networks;Ad Hoc Networks;2022-05

3. Partition detection and recovery by UAVs in damaged WSANs using N‐angle clustering;International Journal of Communication Systems;2022-04-29

4. kNN-Borůvka-GPU: A Fast and Scalable MST Construction from kNN Graphs on GPU;Computational Science and Its Applications – ICCSA 2012;2012

5. Optimality conditions in preference-based spanning tree problems;European Journal of Operational Research;2009-10