Graph theoretic and spectral analysis of Enron email data
From MaRDI portal
Publication:812031
DOI10.1007/S10588-005-5381-4zbMATH Open1108.91345OpenAlexW2005155495MaRDI QIDQ812031FDOQ812031
Authors: Anurat Chapanond, Bülent Yener, Mukkai S. Krishnamoorthy
Publication date: 23 January 2006
Published in: Computational \& Mathematical Organization Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10588-005-5381-4
Recommendations
Cites Work
Cited In (9)
- Heuristical top-\(k\): fast estimation of centralities in complex networks
- Scan statistics on Enron graphs
- On dynamic network security: a random decentering algorithm on graphs
- Evaluation of node position based email communication
- Structure in the Enron email dataset
- Cybersecurity Insurance: Modeling and Pricing
- On the radius of centrality in evolving communication networks
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different
- Social network discovery by mining spatio-temporal events
This page was built for publication: Graph theoretic and spectral analysis of Enron email data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812031)