Applications of graph theory in Optimization and Network Analysis

Authors

  • J. Satish Kumar, K. Muralidharana, R. Srija

Keywords:

Graph theory, optimization, network analysis, shortest path, network flow, clustering, computational efficiency

Abstract

This paper examines three main applications within different domains that utilize graph theory such as finding shortest paths, optimizing network flow throughput and performing clustering operations in massive network structures. The research demonstrates the significance of graph-based models which helps tackle real-world difficulties between logistics operations and traffic systems and biological systems.

References

N. Vesselinova, R. Steinert, D. F. Perez-Ramirez, and M. Boman, "Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking," IEEE Access, vol. 8, pp. 120388–120416, 2020. Available: https://doi.org/10.1109/ACCESS.2020.3004964

O. V. GnanaSwathika and S. Hemamalini, "Graph Theory and Optimization Algorithms Aided Adaptive Protection in Reconfigurable Microgrid," Journal of Electrical Engineering & Technology, vol. 15, pp. 421–431, 2020. Available: https://doi.org/10.1007/s42835-019-00197-8

Downloads

Published

2024-12-02

How to Cite

J. Satish Kumar, K. Muralidharana, R. Srija. (2024). Applications of graph theory in Optimization and Network Analysis. Journal of Computational Analysis and Applications (JoCAAA), 33(08), 2546–2556. Retrieved from https://www.eudoxuspress.com/index.php/pub/article/view/2166

Issue

Section

Articles