On a bounded budget network creation game

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Shayan Ehsani Sharif University of Technology, Tehran, Iran
MohammadAmin Fazli Sharif University of Technology, Tehran, Iran
Abbas Mehrabian University of Waterloo, Waterloo, Canada
Sina Sadeghian Sadeghabad Sharif University of Technology, Tehran, Iran
MohammadAli Safari Sharif University of Technology, Tehran, Iran
Morteza Saghafian Sharif University of Technology, Tehran, Iran
Saber ShokatFadaee Sharif University of Technology, Tehran, Iran
On a bounded budget network creation game Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 25
· Downloads (cumulative): 69
· Citation Count: 4

Published in:
Cover Image
 
· Proceeding
SPAA '11 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures
Pages 207-214
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0743-7 doi>10.1145/1989493.1989523

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder