Statistics
| Branch: | Revision:

## root / fiddle @ e066fa74

# Date Author Comment
e066fa74 04/01/2016 10:32 AM

All the data of the experiments for Heuristic Betweenness Centrality and Brandes BC.

29847a7d 03/11/2016 11:24 AM

[Milestone] Analysis - automatically generate all the graph for all *.out1 input. Those graphs are:
- Line chart of running time for BC and HBC with the increasing number of nodes for each graph type [CN | PL | ER] on [router | server] > 4 charts
- Bar chart for running time of BC, HBC on [router | server] for Real Community Networks Ninux, FFG, FFW > 2 charts...

4ceb9f92 03/09/2016 03:51 PM

Plot the running time of BC and HBC for 3 types of graphs: Erdos, Community Network and Power Lab

072a5b5a 03/09/2016 02:23 PM

Analyze the experiment result.
Input: *.out1
Output: *.out2, *.out3

.out2 the average running time for each graphs, from 10 repetitions.
.out3 the average running time for each [graph type (Community Network, Erdos), and number of nodes (from 100 - 1000)]...

4b37c1d9 03/07/2016 12:36 PM

Analyze the bi-connected components for CN and PL graphs

3673c3e8 02/16/2016 03:36 PM

[HBC - Python] Backup code

82c7c698 12/29/2015 09:33 PM

[f] WBBC = HBC :)

739fe075 12/28/2015 01:35 AM

Heuristic BC for different graphs

24a4abf9 12/20/2015 01:04 PM

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

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

3c6ce57c 12/20/2015 12:52 AM

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

f1ee8a55 12/13/2015 02:11 PM

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

Heuristic Betweenness for Structurally Equivalence Class

8e44cb4f 12/13/2015 02:09 PM

[r] Heuristic Betweenness for bi-connected components

181e7c50 12/09/2015 03:25 PM

Heuristic betweenness centrality - block cut tree

37200dce 12/01/2015 02:24 PM

Add label to x and y-axis in graph

f2accca4 11/28/2015 10:10 AM

Script to plot comparison graph between networkx and Boost Graph Library

1705a309 11/27/2015 10:34 AM

Comparision between networkx and Boost Graph Library

c28093c1 11/20/2015 01:01 AM

Fiddling around with C++ - pointer and template function

23e90e7c 09/21/2015 02:25 PM

Fiddling around with networkx library