First Page | Document Content | |
---|---|---|
Date: 2011-11-19 02:38:20Network theory Networks Network analysis Algebraic graph theory Centrality Betweenness centrality Shortest path problem Distance Floyd–Warshall algorithm Graph theory Mathematics Theoretical computer science | A Faster Algorithm for Betweenness Centrality∗ Ulrik Brandes University of Konstanz Department of Computer & Information Science Box D 67, 78457 Konstanz, Germany [removed]Add to Reading ListSource URL: snap.stanford.eduDownload Document from Source WebsiteFile Size: 155,22 KBShare Document on Facebook |
TARANET: Traffic-Analysis Resistant Anonymity at the Network Layer Chen Chen Daniele E. AsoniDocID: 1xVHd - View Document | |
arXiv:1802.08415v1 [cs.CR] 23 FebTARANET: Traffic-Analysis Resistant Anonymity at the NETwork layer Chen ChenDocID: 1xVuF - View Document | |
iTAP: In-network Traffic Analysis Prevention using Software-Defined Networks https://itap.ethz.ch Roland MeierDocID: 1xUBt - View Document | |
iTAP: In-network Traffic Analysis Prevention using Software-Defined Networks https://itap.ethz.ch Roland MeierDocID: 1xTNw - View Document | |
Leveraging Internet Background Radiation for Opportunistic Network Analysis Karyn Benson∗† , Alberto Dainotti† , kc claffy† , Alex C. Snoeren∗ , Michael Kallitsis‡ ∗ Computer Science and Engineering, UC SaDocID: 1xTnc - View Document |