Efficient Network Analysis Under Single Link Deletion
Max Ward, Amitava Datta, Hung X. Nguyen, Jason Eshraghian

TL;DR
This paper defines the single edge deletion problem in networks, proposing a fast algorithm to identify the edge whose removal causes maximum disruption, with broad theoretical and practical implications.
Contribution
It formally defines the single edge deletion problem and introduces a novel, efficient algorithm that generalizes to computing all-pairs shortest paths after edge deletions.
Findings
Algorithm solves the problem faster than naive methods
Generalizes to all-pairs shortest path computations after deletions
Has deep theoretical and practical applications
Abstract
The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the largest disruption? More formally, given a graph, which edge after deletion disconnects the maximum number of pairs of vertices, where ties for number of pairs disconnected are broken by finding an edge that increases the average shortest path length the maximum amount. This problem is interesting both practically and theoretically. We call it the \emph{single edge deletion problem}. Our contributions include formally defining the single edge deletion problem and providing motivations from network analysis. Also, we give an algorithm that solves the problem much faster than a naive solution. The algorithm incorporates sophisticated and novel techniques, and generalises to the problem of computing the…
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.
Taxonomy
TopicsAdvanced Graph Theory Research · DNA and Biological Computing · Complexity and Algorithms in Graphs
