<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-10-24 12:37:32Network theory Networks Network analysis Algebraic graph theory Centrality Betweenness centrality Shortest path problem Distance Floyd–Warshall algorithm Graph theory Mathematics Theoretical computer science |
Add to Reading List |
A Faster Algorithm for Betweenness Centrality | System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. WilkersonDocID: 1gm8d - View Document |
| Outcome and variable prediction for discrete processes A framework for finding answers to business questions using (process) data Master Thesis of Sjoerd van der SpoelDocID: 19L4n - View Document |
| Subcubic Equivalences Between Path, Matrix, and Triangle Problems∗ Virginia Vassilevska Williams† Ryan Williams‡DocID: 18uIp - View Document |
| Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low TreewidthDocID: 18t59 - View Document |
| System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. WilkersonDocID: 17YFQ - View Document |