| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141428 | Discrete Optimization | 2014 | 7 Pages |
Abstract
This paper deals with the 2-maxian problem on cactus graphs. It is shown that in the worst case the midpoint of any path connecting m1 and m2, where {m1,m2} is the 2-maxian of the cactus, lies on a specified cycle. Based on this property, we develop an algorithm with time complexity of O(n2) for the problem on a cactus with n vertices.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Liying Kang, Chunsong Bai, Erfang Shan, Kien Nguyen,