Loading...

Parallel minimum spanning tree heuristic for the steiner problem in graphs

Akbari, H ; Sharif University of Technology | 2007

393 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICPADS.2007.4447726
  3. Publisher: 2007
  4. Abstract:
  5. Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph. Minimum Spanning Tree Heuristic (MSTH) is a heuristic for solving the Steiner problem in graphs. In this paper we first review existing algorithms for solving the Steiner problem in graphs. We then introduce a new parallel version of MSTH on three dimensional mesh of trees architecture. We describe our algorithm and analyze its time complexity. The time complexity analysis shows that the algorithm's running time is O(lg2 n) which is comparable with other existing parallel solutions. © 2007 IEEE
  6. Keywords:
  7. Chlorine compounds ; Graph theory ; Heuristic methods ; Heuristic programming ; Query processing ; Three dimensional ; International conferences ; Minimum spanning tree ; Minimum weight ; Parallel and distributed systems ; Parallel version ; Running time ; Steiner problems ; Steiner Tree Problem ; Sub trees ; Three-dimensional meshes ; Time complexities ; Undirected graphs ; Trees (mathematics)
  8. Source: 13th International Conference on Parallel and Distributed Systems, ICPADS, Hsinchu, 5 December 2007 through 7 December 2007 ; Volume 1 , December , 2007 ; 15219097 (ISSN); 9781424418909 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4447726