Rank: 1282 based on 122 downloads (last 30 days) and 6 files submitted
photo

Anh-Dung Nguyen

E-mail
Company/University
ISAE-University of Toulouse

Personal Profile:

 

Watch this Author's files

 

Files Posted by Anh-Dung Nguyen View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
08 Jan 2013 All-pairs Shortest Dynamic Path Length Algorithm Algorithm computing the shortest-dynamic-path-length between all pairs of nodes in a dynamic network Author: Anh-Dung Nguyen dynamic networks, temporal graphs, shortest dynamic path, allpairs 11 0
07 Jan 2013 Dynamic Clustering Coefficient Algorithm Algorithm calculating the dynamic clustering coefficient of a dynamic network Author: Anh-Dung Nguyen dynamic networks, temporal graphs, dynamic clustering co... 9 0
07 Jan 2013 Breath First Search Breath First Search algorithm to find shortest paths in a network Author: Anh-Dung Nguyen bfs, shortest path, graph, network 22 1
07 Jan 2013 Temporal Graph Visualization Visualize the evolution of a temporal graph Author: Anh-Dung Nguyen temporal graphs, dynamic network, visualization 11 0
31 Oct 2012 Screenshot STEPS mobility model STEPS is a simple parametric model which can cover a large spectrum of human mobility patterns Author: Anh-Dung Nguyen human mobility, mobility model, preferential attachme..., attractor, power law, markov chain 22 0
Comments and Ratings by Anh-Dung Nguyen
Updated File Comments Rating
29 Oct 2012 k-clique algorithm k-clique community detection algorithm Author: Anh-Dung Nguyen

The result is correct. In fact, the algorithm first extracts all complete subgraphs that are not parts of larger complete subgraphs. These maximal complete subgraphs are called "cliques". I'll modify the description. Thank you.

Comments and Ratings on Anh-Dung Nguyen's Files View all
Updated File Comment by Comments Rating
10 Nov 2014 Breath First Search Breath First Search algorithm to find shortest paths in a network Author: Anh-Dung Nguyen Linh Thái Lyen

Error using bfs ( in line 14 )

05 Jun 2014 k-clique algorithm k-clique community detection algorithm Author: Anh-Dung Nguyen SAMUEL HEROY

I am confused. I created an adjacency matrix that generates a 2x4 scaffold with 8 pairwise adjacent 3-cliques. (My adj matrix is
0 1 1 1 0 0 0 0
1 0 0 1 0 0 0 0
1 0 0 1 1 0 0 0
1 1 1 0 1 1 0 0
0 0 1 1 0 1 1 1
0 0 0 1 1 0 0 1
0 0 0 0 1 0 0 1
0 0 0 0 1 1 1 0
).
However, the cliques output only returns four entries when I query for 3-cliques and associated communities:
[1,3,4]
[3,4,5]
[4,5,6]
[5,7,8]
By my understanding of this algorithm's intention, shouldn't there be four more entries here--and one large community that spans the network?

27 Dec 2013 k-clique algorithm k-clique community detection algorithm Author: Anh-Dung Nguyen learn learn

i found after execute the code source this result. but i can't well understand what's mean.
M

M =

1 1 0 0 0 0 0 0 0 1
1 1 1 1 1 1 1 0 0 1
0 1 1 1 0 0 1 0 0 0
0 1 1 1 1 1 1 0 0 0
0 1 0 1 1 1 1 1 0 0
0 1 0 1 1 1 1 1 0 0
0 1 1 1 1 1 1 1 1 1
0 0 0 0 1 1 1 1 1 1
0 0 0 0 0 0 1 1 1 1
1 1 0 0 0 0 1 1 1 1

>> m=4;
>> [X,Y,Z] = k_clique(m,M)

X =

[1x7 double]
[1x4 double]

Y =

[1x5 double]
[1x4 double]
[1x4 double]
[1x4 double]
[1x3 double]
[1x3 double]

Z =

1 1 1 0 0 0
1 1 0 0 0 0
1 0 1 0 0 0
0 0 0 1 0 0
0 0 0 0 0 0
0 0 0 0 0 0

>>

29 Oct 2012 k-clique algorithm k-clique community detection algorithm Author: Anh-Dung Nguyen Anh-Dung Nguyen

The result is correct. In fact, the algorithm first extracts all complete subgraphs that are not parts of larger complete subgraphs. These maximal complete subgraphs are called "cliques". I'll modify the description. Thank you.

13 Sep 2012 k-clique algorithm k-clique community detection algorithm Author: Anh-Dung Nguyen YANG

I have a question
if A is 4*4 complete graph
[X,Y,Z] = k_clique(3,A);
Y is [1 2 3 4] and not find all cliques of size 3

Contact us