/fiddle - Repository - QuynhNguyen-MS - Redmine

Name	Size	Revision	Age	Author	Comment
boost-networkx-comparision		37200dce	about 5 years	Quynh PX Nguyen	Add label to x and y-axis in graph
count_num_bcc		4b37c1d9	almost 5 years	Quynh PX Nguyen	Analyze the bi-connected components for CN and ...
heuristic-betweenness-centrality		3673c3e8	about 5 years	Quynh PX Nguyen	[HBC - Python] Backup code
simulation_analysis		4ceb9f92	almost 5 years	Quynh PX Nguyen	Plot the running time of BC and HBC for 3 types...
Makefile	81 Bytes	c28093c1	over 5 years	Quynh PX Nguyen	Fiddling around with C++ - pointer and template...
libnetworkx.py	448 Bytes	23e90e7c	over 5 years	Quynh PX Nguyen	Fiddling around with networkx library
pointer	13.4 KB	c28093c1	over 5 years	Quynh PX Nguyen	Fiddling around with C++ - pointer and template...
pointer.cpp	3.12 KB	c28093c1	over 5 years	Quynh PX Nguyen	Fiddling around with C++ - pointer and template...
template_function	13.5 KB	c28093c1	over 5 years	Quynh PX Nguyen	Fiddling around with C++ - pointer and template...
template_function.cpp	1.09 KB	c28093c1	over 5 years	Quynh PX Nguyen	Fiddling around with C++ - pointer and template...

#	Date	Author	Comment
4ceb9f92	03/09/2016 03:51 PM	Quynh PX Nguyen	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	Quynh PX Nguyen	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	Quynh PX Nguyen	Analyze the bi-connected components for CN and PL graphs
3673c3e8	02/16/2016 03:36 PM	Quynh PX Nguyen	[HBC - Python] Backup code
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

Thesis » QuynhNguyen-MS