Sciweavers

5606 search results - page 84 / 1122
» Randomization Techniques for Graphs.
Sort
View
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
14 years 9 months ago
Oblivious routing in directed graphs with random demands
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 9 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari