— Despite significant efforts to obtain an accurate picture of the Internet’s connectivity structure at the level of individual autonomous systems (ASes), much has remained un...
Ricardo V. Oliveira, Dan Pei, Walter Willinger, Be...
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
: This paper discusses the interplay between networks and control systems. As we gain more understanding about the structure and dynamics of physical networks, their effects on the...
A. Clauset, Herbert G. Tanner, Chaouki T. Abdallah...
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...