Sciweavers

WG
1999
Springer
13 years 8 months ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
STOC
2006
ACM
57views Algorithms» more  STOC 2006»
14 years 4 months ago
Integrality gaps for sparsest cut and minimum linear arrangement problems
Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...