1542 search results - page 7 / 309 » The metamathematics of random graphs |
108
click to vote
SIGMETRICS
2010
ACM
14 years 10 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
262
click to vote
PAMI
2010
14 years 10 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
144
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
119
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
120
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...