@article{scholars17598,
            year = {2022},
             doi = {10.1155/2022/9661411},
            note = {cited By 1},
          volume = {2022},
         journal = {Wireless Communications and Mobile Computing},
       publisher = {Hindawi Limited},
           title = {A Robust Graph Theoretic Solution of Routing in Intelligent Networks},
        abstract = {Implementation of robust routing is very critical in network communication. Connecting devices like routers maintain databases for the whole network topology in the routing table. Each router needs to keep these tables updated with the best possible routes so that an efficient communication can always take place in nondelay tolerant intelligent networks that include military and tactical systems, vehicular communication networks, underwater acoustic networks, and intelligent sensor networks. The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. That is why a simple and efficient algorithm is the need of the time. A robust routing solution SPT with OV+E time complexity is proposed to supersede the existing landmark. {\^A}{\copyright} 2022 Muhammad Aasim Qureshi et al.},
        keywords = {Graph theory; Intelligent networks; Military communications; Network routing; Network topology; Underwater acoustic communication; Underwater acoustics, Efficient communications; Graph theoretics; In networks; Network communications; Network topology; Robust graphs; Robust routing; Routing table; Routings; Shortest Paths Tree, Sensor networks},
             url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85133587852&doi=10.1155\%2f2022\%2f9661411&partnerID=40&md5=596a59da6c90e65c28c6f0f674d36a10},
            issn = {15308669},
          author = {Qureshi, M. A. and Hassan, M. F. and Ehsan, M. K. and Khan, M. O. and Ali, M. Y. and Khan, S.}
}