| Autor: |
Kien Trung Nguyen, Van Chien, Pham, Ly Hong Hai, Huynh Duc Quoc |
| Předmět: |
|
| Zdroj: |
Applications & Applied Mathematics; Jun2017, Vol. 12 Issue 1, p70-77, 8p |
| Abstrakt: |
We address the problem of finding a 1-median on a cactus graph. The problem has already been solved in linear time by the algorithms of Burkard and Krarup (1998), and Lan and Wang (2000). These algorithms are complicated and need efforts. Hence, we develop in this paper a simpler algorithm. First, we construct a condition for a cycle that contains a 1-median or for a vertex that is indeed a 1-median of the cactus. Based on this condition, we localize the search for deriving a 1-median on the underlying cactus. Complexity analysis shows that the approach runs in linear time. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
