Abstract
We consider two frequently encountered problems in the modeling of the communication network, related to the construction of a graph of the communication network that meets certain conditions. Heuristic algorithms for solving these problems are proposed. The question of uniqueness of the solution of the set tasks is investigated. A positive result of solving the problem was obtained and sufficient conditions of uniqueness were found. The research and development of appropriate software are of practical importance in the design of real communication networks.
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.
