745 search results - page 98 / 149 » On Generating Random Network Structures: Connected Graphs |
139
click to vote
ICOIN
2007
Springer
15 years 9 months ago
2007
Springer
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
140
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
133
click to vote
CIA
2007
Springer
15 years 7 months ago
2007
Springer
: Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. ...
134
Voted
EKAW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Qualitative reasoning uses a limited set of relevant distinctions of the domain to allow a flexible way of representing and reasoning about it. This work presents a conce...
144
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...