1949 search results - page 129 / 390 » Random graphs on surfaces |
225
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
135
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
132
click to vote
APVIS
2007
15 years 5 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
147
click to vote
USENIX
2007
15 years 6 months ago
2007
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
177
click to vote
ISCA
2012
IEEE
13 years 6 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...