| Branch: | Revision:

root / fiddle / heuristic-betweenness-centrality @ 82c7c698

# Date Author Comment
82c7c698 12/29/2015 09:33 PM Quynh PX Nguyen

[f] WBBC = HBC :)

739fe075 12/28/2015 01:35 AM Quynh PX Nguyen

Heuristic BC for different graphs

24a4abf9 12/20/2015 01:04 PM Quynh PX Nguyen

Compute Component Tree Weights - Bugs fixed
- Component-vertex pair (B, v): minus 1 unit more
- Vertex-component pair (v, B): initialize size = 0

Results: Correct even for Sample 4. Still not correct for Ninux Graph.

54b6e5c3 12/20/2015 12:54 AM Quynh PX Nguyen

More examples to debug the Computing Component Tree Weights - I found problems for the simple4.edges

3c6ce57c 12/20/2015 12:52 AM Quynh PX Nguyen

Debugging the Algorithm 1: Compute Component Tree Weights [Puzis 2012]

f1ee8a55 12/13/2015 02:11 PM Quynh PX Nguyen

Done with creating the communication importance matrix (or Traffic Matrix). This is necessary in calculating betweenness centrality later

a7c5c0e2 12/13/2015 02:09 PM Quynh PX Nguyen

Heuristic Betweenness for Structurally Equivalence Class

8e44cb4f 12/13/2015 02:09 PM Quynh PX Nguyen

[r] Heuristic Betweenness for bi-connected components

181e7c50 12/09/2015 03:25 PM Quynh PX Nguyen

Heuristic betweenness centrality - block cut tree