Sciweavers

4962 search results - page 366 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
TON
2010
122views more  TON 2010»
15 years 5 months ago
The (in)completeness of the observed internet AS-level structure
— 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...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 9 months ago
Finding maximal k-edge-connected subgraphs from a large graph
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...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
ARC
2008
Springer
117views Hardware» more  ARC 2008»
15 years 6 months ago
Controlling across complex networks - Emerging links between networks and control
: 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...
IPPS
1998
IEEE
15 years 11 months ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
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...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
CJ
2010
128views more  CJ 2010»
15 years 6 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
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...