Fast centrality approximation in modular networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Shu Yan Chan Univeristy of Cambridge, Cambridge, United Kingdom
Ian X.Y. Leung University of Cambridge, Cambridge, United Kingdom
Pietro Liò University of Cambridge, Cambridge, United Kingdom
Published in:
Cover Image
 
· Proceeding
CNIKM '09 Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Pages 31-38
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-807-0 doi>10.1145/1651274.1651282
Fast centrality approximation in modular networks Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 42
· Downloads (cumulative): 154
· Citation Count: 3


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