SIGN IN
SIGN UP
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Full Text:
PDF
Buy this Article
Authors:
A. Lyritsis
Aristotle University, Thessaloniki, Greece
A. N. Papadopoulos
Aristotle University, Thessaloniki, Greece
Y. Manolopoulos
Aristotle University, Thessaloniki, Greece
Published in:
· Proceeding
EDBT/ICDT '11
Proceedings of the 14th International Conference on Extending Database Technology
Pages 295-306
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0528-0
doi>
10.1145/1951365.1951402
2011 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 34
· Downloads (cumulative): 88
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
data mining
graph algorithms
graph databases
proximity query processing
systems
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder