ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Discovering important nodes through graph entropy the case of Enron email database

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Jitesh Shetty University of Southern California, Los Angeles, CA
Jafar Adibi USC Information Sciences Institute, Marina del Rey, CA
Published in:
· Proceeding
LinkKDD '05 Proceedings of the 3rd international workshop on Link discovery
ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-215-1 doi>10.1145/1134271.1134282
Discovering important nodes through graph entropy the case of Enron email database Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 145
· Citation Count: 15


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 © 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