Computing a diameter-constrained minimum spanning tree in parallel

DOI10.1007/3-540-46521-9_2MaRDI QIDQ2728889zbMATH OpenFDO

Authors Narsingh Deo, Ayman Abdalla

Publication date 6 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46521-9_2

zbMATH Keywords

heuristics of the DCMST problemminimum spanning treeparallel graph algorithmsparallel implementationsmall diameter

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Recommendations

• A Parallel Algorithm for Computing Minimum Spanning Trees
• scientific article; zbMATH DE number 1556480
• Parallel Algorithms for Minimum Spanning Tree Problem
• scientific article; zbMATH DE number 24457
• Minimal spanning trees: An empirical investigation of parallel algorithms
• Improving the efficiency of parallel minimum spanning tree algorithms
• An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
• An optimal parallel algorithm for minimum spanning trees in planar graphs
• scientific article; zbMATH DE number 1161335
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees

Cited in

(10)

• A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• The two-level diameter constrained spanning tree problem
• Minimum diameter cost-constrained Steiner trees
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• scientific article; zbMATH DE number 1161326 (Why is no real title available?)
• A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
• scientific article; zbMATH DE number 1439494 (Why is no real title available?)
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem

This page was built for publication: Computing a diameter-constrained minimum spanning tree in parallel

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