iPoG: fast interactive proximity querying on graphs

doi:10.1145/1645953.1646201

SIGN IN SIGN UP

iPoG: fast interactive proximity querying on graphs

Full Text:

PDF

Buy this Article

Authors:	Hanghang Tong	Carnegie Mellon University, Pittsburgh, PA, USA
	Huiming Qu	IBM T. J. Watson Research, Hawthorne, NY, USA
	Hani Jamjoom	IBM T. J. Watson Research, Hawthorne, NY, USA
	Christos Faloutsos	Carnegie Mellon University, Pittsburgh, PA, USA

	2009 Article Poster
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 49 · Citation Count: 0

Published in:

	· Proceeding
	CIKM '09 Proceedings of the 18th ACM conference on Information and knowledge management
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-512-3 doi>10.1145/1645953.1646201

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- CIKM'12

Share:

|

Tags: algorithms data mining experimentation graph mining proximity scalability

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 Digital Library is published by the Association for Computing Machinery. Copyright © 2012 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