A note on locating a central vertex of a 3-cactus graph

Rex K. Kincaid*, Oded Z. Maimon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


We 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.

Original languageEnglish
Pages (from-to)315-320
Number of pages6
JournalComputers and Operations Research
Issue number3
StatePublished - 1990


Dive into the research topics of 'A note on locating a central vertex of a 3-cactus graph'. Together they form a unique fingerprint.

Cite this