Abstract
The median problem has been extensively studied in the last three decades. On general graphs, the problem can be solved in O( n 3), where n is the number of vertices in a graph. For tree networks, however, more efficient algorithms can be devised to find the medians in O( n). In this paper, we study weighted 4-cactus (W4C) graphs which provide a less restrictive network structure than trees and show that median problem can be solved just as efficiently on W4C graphs as on trees. Many examples are provided demonstrating the rudiments of our algorithm and a linear time complexity algorithm is 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.
