scientific article
From MaRDI portal
Publication:2728889
zbMath0971.68591MaRDI QIDQ2728889
Publication date: 6 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel implementationminimum spanning treeparallel graph algorithmssmall diameterheuristics of the DCMST problem
Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Greedy heuristics for the diameter-constrained minimum spanning tree problem ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Solving diameter-constrained minimum spanning tree problems by constraint programming ⋮ A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ The two-level diameter constrained spanning tree problem
This page was built for publication:
