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

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

0.00 Avg rating0 Votes
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: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.