Compact reachability labeling for graph-structured data

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Hao He Duke University, Durham, NC
Haixun Wang IBM T. J. Watson Research, Hawthorne, NY
Jun Yang Duke University, Durham, NC
Philip S. Yu IBM T. J. Watson Research, Hawthorne, NY
Compact reachability labeling for graph-structured data Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 30
· Downloads (cumulative): 431
· Citation Count: 11

Published in:
Cover Image
 
· Proceeding
CIKM '05 Proceedings of the 14th ACM international conference on Information and knowledge management
Pages 594-601
ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-140-6 doi>10.1145/1099554.1099708

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