Loading...

Parallel algorithm to find minimum vertex guard set in a triangulated irregular network

Taghinezhad Omran, M ; Sharif University of Technology | 2008

398 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-68111-3_26
  3. Publisher: 2008
  4. Abstract:
  5. This paper presents a new serial algorithm for selecting a nearly minimum number of vertex-guards so that all parts of a geographical surface modeled by a TIN (Triangulated Irregular Networks) is covered. Our algorithm selects fewer guards than the best existing algorithms on the average. Based on this approach, a new coarse-grain parallel algorithm for this problem is proposed. It has been showed that the upper bound for total number of guards, selected by this algorithm, is where n is number of vertices in the TIN. Average case analysis and implementation results show that in real TINs even fewer than guards (proved upper bound of needed guards in worse-case) are selected by our serial and parallel algorithms. © 2008 Springer-Verlag Berlin Heidelberg
  6. Keywords:
  7. Applied mathematics ; Average-case analysis ; Coarse-grain parallel algorithm ; Geographical surface ; Heidelberg (CO) ; International conferences ; Parallel processing ; Serial algorithms ; Springer (CO) ; Triangulated irregular network (TIN) ; Upper bounds ; Algorithms ; Boolean functions ; Computer networks ; Evolutionary algorithms ; Metropolitan area networks ; Network protocols ; Paper ; Parallel processing systems ; Scheduling algorithms ; Set theory ; Statistics ; Tin ; Tinning ; Titanium compounds ; Trees (mathematics) ; Parallel algorithms
  8. Source: 7th International Conference on Parallel Processing and Applied Mathematics, PPAM 2007, Gdansk, 9 September 2007 through 12 September 2007 ; Volume 4967 LNCS , 2008 , Pages 239-248 ; 03029743 (ISSN); 3540681051 (ISBN); 9783540681052 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-68111-3_26