Accelerating Shortest-Path Computation in Ring Networks Via Graph Simplification
This paper presents a method for graph simplification that aims to improve routing efficiency in large-scale communication networks. The approach identifies rings—linear chains of degree-2 vertices decorated with pendant trees and attached to the rest of the network via two connection points. In the simplified represen...