On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: William Hendrix North Carolina State University, Raleigh, NC and Oak Ridge National Laboratory, Oak Ridge, TN
Matthew C. Schmidt North Carolina State University, Raleigh, NC and Oak Ridge National Laboratory, Oak Ridge, TN
Paul Breimyer North Carolina State University, Raleigh, NC and Oak Ridge National Laboratory, Oak Ridge, TN
Nagiza F. Samatova North Carolina State University, Raleigh, NC and Oak Ridge National Laboratory, Oak Ridge, TN
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 20
· Downloads (cumulative): 144
· Citation Count: 0

Published in:
Cover Image
 
· Proceeding
U '09 Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Pages 48-56
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-675-5 doi>10.1145/1610555.1610562

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