Finding maximum degrees in hidden bipartite graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Yufei Tao Chinese University of Hong Kong, Hong Kong, Hong Kong
Cheng Sheng Chinese University of Hong Kong, Hong Kong, Hong Kong
Jianzhong Li Harbin Institute of Technology, Harbin, China
Published in:
Cover Image
 
· Proceeding
SIGMOD '10 Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Pages 891-902
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0032-2 doi>10.1145/1807167.1807263
Finding maximum degrees in hidden bipartite graphs Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 57
· Downloads (cumulative): 300
· Citation Count: 2


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