9532 search results - page 52 / 1907 » Logic, Graphs, and Algorithms |
110
click to vote
SIAMDM
2010
14 years 7 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
74
Voted
SWAT
2000
Springer
15 years 4 months ago
2000
Springer
90
Voted
STOC
2007
ACM
16 years 28 days ago
2007
ACM
STOC
2006
ACM
16 years 28 days ago
2006
ACM
STOC
2002
ACM
16 years 27 days ago
2002
ACM
