SIGN IN
SIGN UP
How to spread adversarial nodes?: rotate!
Full Text:
PDF
Buy this Article
Author:
Christian Scheideler
Johns Hopkins University, Baltimore, MD
Published in:
· Proceeding
STOC '05
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pages 704-713
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-960-8
doi>
10.1145/1060590.1060694
2005 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 21
· Downloads (cumulative): 410
· Citation Count: 13
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
graph algorithms
join-leave attacks
network problems
proactive security
random mixing
routing and layout
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder