5606 search results - page 43 / 1122 » Randomization Techniques for Graphs. |
GD
1995
Springer
14 years 21 days ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
AML
1999
13 years 8 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
MFCS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...