688 search results - page 95 / 138 » General Partitioning on Random Graphs |
108
click to vote
ESA
1997
Springer
15 years 4 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
83
Voted
TIT
2008
15 years 12 days ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
103
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
107
Voted
JITECH
2010
14 years 11 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
122
click to vote
WWW
2003
ACM
16 years 1 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...