SIGN IN
SIGN UP
PAnG: finding patterns in annotation graphs
Full Text:
PDF
Buy this Article
Authors:
Philip Anderson
University of Maryland, College Park, MD, USA
Andreas Thor
University of Maryland, College Park, MD, USA
Joseph Benik
University of Maryland, College Park, MD, USA
Louiqa Raschid
University of Maryland, College Park, MD, USA
Maria Esther Vidal
Universidad Simon Bolivar, Caracas, Venezuela
2012 Article
Demonstration
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 148
· Downloads (cumulative): 148
· Citation Count: 1
Published in:
· Proceeding
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Pages 677-680
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-1247-9
doi>
10.1145/2213836.2213930
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
data mining
dense subgraphs
graph summarization
graphs and networks
link prediction
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