Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
