1542 search results - page 159 / 309 » The metamathematics of random graphs |
120
click to vote
ENDM
2008
15 years 2 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
135
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
139
click to vote
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
121
click to vote
GRC
2008
IEEE
15 years 3 months ago
2008
IEEE
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
134
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...