Article ID: | iaor199069 |
Country: | United Kingdom |
Volume: | 17 |
Start Page Number: | 315 |
End Page Number: | 320 |
Publication Date: | Apr 1990 |
Journal: | Computers and Operations Research |
Authors: | Kincaid Rex K., Maimon Oded Z. |
The authors extend linear time algorithms for a variety of vertex location measures on trees to include 3-cactus graphs. To do this the original 3-cactus graph is transformed into a tree. The behavior of median and variance measures under this transformation is studied and linear (in the number of vertices) time complexity algorithms for the minimum weighted vertex variance problem and the vertex restricted stochastic queue median are developed.