SIGN IN
SIGN UP
Coherent closed quasi-clique discovery from large dense graph databases
Full Text:
PDF
Buy this Article
Authors:
Zhiping Zeng
Tsinghua University, Beijing, P.R. China
Jianyong Wang
Tsinghua University, Beijing, P.R. China
Lizhu Zhou
Tsinghua University, Beijing, P.R. China
George Karypis
University of Minnesota, Minneapolis, MN
2006 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 52
· Downloads (cumulative): 480
· Citation Count: 20
Published in:
· Proceeding
KDD '06
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Pages 797-802
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-339-5
doi>
10.1145/1150402.1150506
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
KDD 13
Share:
|
Tags:
algorithms
coherent subgraph
data mining
graph mining
quasi-clique
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