# Date Author Comment
d5b7a27f 02/16/2016 03:29 PM Quynh PX Nguyen

[HBCW] Heuristic Betweenness Centrality for weighted graph

e263e3c7 02/15/2016 04:33 PM Quynh PX Nguyen

It's now working with
- jsoninfo_topo.json
- graph where there are edges that are not included in Bi-Connected Components (for example, in jsoninfo_topo.json

Check whether graph is connected

162e1bda 02/11/2016 05:25 PM Quynh PX Nguyen

[milestone] HBC - working for unweighted graph. The generates the output and the score for BC and HBC.

71a9891a 01/30/2016 07:08 AM Quynh PX Nguyen

[f] Count how many times a certain value (not key) appearing in a Map.

437fd680 01/29/2016 01:14 PM Quynh PX Nguyen

[f] Skeleton for HBC calculation. For each sub-component, now we are using the standard function boost::brandes_betweenness_centrality() to get their BC scores.

20756421 01/28/2016 11:31 PM Quynh PX Nguyen

[HBC] BC score for Sub-Component.

293a61eb 01/28/2016 11:08 PM Quynh PX Nguyen

[f] Adding test

cb770240 01/28/2016 11:08 PM Quynh PX Nguyen

[R] Working: Refactor Heuristic BCC version. Now all the Link Weight and Traffic Matrix for each Sub-Component are correct. Also, we have the Graph object for each Sub-Component.

efed924d 01/14/2016 05:55 PM Quynh PX Nguyen

[cpp, r] Done with creating subgraph for each sub component

ee0dd796 01/14/2016 05:21 AM Quynh PX Nguyen

[cpp] Heuristic - Jan 14 - output graph

9186225c 12/29/2015 09:55 PM Quynh PX Nguyen

[misc] Test set used to find bug in HBC

b56a7ca2 12/29/2015 09:50 PM Quynh PX Nguyen

[latex] Update note

50aa86a1 12/29/2015 09:47 PM Quynh PX Nguyen

[latex] Report Dec 20

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]

946f4f73 12/15/2015 01:51 PM Quynh PX Nguyen

[r] Use reference-to-const for function arguments.

c6961065 12/15/2015 11:57 AM Quynh PX Nguyen

[r] Split into modules

6a12e353 12/15/2015 10:21 AM Quynh PX Nguyen

[r] Modularized into parser, utility for code to calculate betweennes

04a9ef10 12/13/2015 10:31 PM Quynh PX Nguyen

[r] Modularize code

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

1 2 3 (26-50/70) Per page: 25, 50, 100

Also available in: Atom