[HBCW] Heuristic Betweenness Centrality for weighted graph

[HBC]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

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

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

[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.

[HBC] BC score for Sub-Component.

[f] Adding test

[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.

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

[cpp] Heuristic - Jan 14 - output graph

[misc] Test set used to find bug in HBC

[latex] Update note

[latex] Report Dec 20

[f] WBBC = HBC :)

Heuristic BC for different graphs

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.

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

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

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

[r] Split into modules

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

[r] Modularize code

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

Heuristic Betweenness for Structurally Equivalence Class

[r] Heuristic Betweenness for bi-connected components

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

Also available in: Atom