Abstract
The hierarchical communication network considered in this paper is a two-level network, which is used for communicating messages between some pairs of nodes of the network. The first level network consists of capacitated arcs between communicating pairs of nodes and the second level network consists of a spanning tree. Assuming that the flow requirements increase over time at a constant rate for each communicating pair, the decision problem is to determine, for each communicating pair of nodes, the time when the communication will break down due to insufficient capacity of arcs in the network. In this paper, we develop an O( n 2 + nω) time algorithm to solve this problem, where n denotes the number of nodes in the network and ω denotes the number of communicating node pairs.
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.
