Sciweavers

2304 search results - page 57 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICNP
2005
IEEE
15 years 5 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
15 years 5 months ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget
EDBTW
2006
Springer
15 years 1 months ago
Change Management in Large-Scale Enterprise Information Systems
The information infrastructure in today's businesses consists of many interoperating autonomous systems. Changes to a single system can therefore have an unexpected impact on ...
Boris Stumm
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 1 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
16 years 1 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...