1542 search results - page 105 / 309 » The metamathematics of random graphs |
152
click to vote
FSEN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
186
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
180
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
174
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
119
click to vote
CPC
2010
15 years 6 months ago
2010
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...