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.
Nguyen, Kien T.; Chien, Pham V.; Hai, Ly H.; and Quoc, Huynh D.
A Simple Linear Time Algorithm for Computing a 1-Median on Cactus Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 12,
1, Article 5.
Available at: https://digitalcommons.pvamu.edu/aam/vol12/iss1/5