Graph Theory Applications in Network Security
Jonathan Webb, Fernando Docemmilli, Mikhail Bonin

TL;DR
This paper reviews how graph theory is applied in network security, focusing on algorithms, network coding, and routing, highlighting its importance and complexity in the field.
Contribution
It provides a comprehensive overview of key graph theory applications in network security, emphasizing algorithmic methods and their relevance.
Findings
Highlights the role of graph algorithms in security protocols
Explores network coding as a routing technique
Discusses the complexity of applying graph theory in practice
Abstract
Graph theory has become a very critical component in many applications in the computing field including networking and security. Unfortunately, it is also amongst the most complex topics to understand and apply. In this paper, we review some of the key applications of graph theory in network security. We first cover some algorithmic aspects, then present network coding and its relation to routing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
