Rank: 949 based on 95 downloads (last 30 days) and 6 files submitted
photo

Anh-Dung Nguyen

E-mail
Company/University
ISAE-University of Toulouse

Personal Profile:
Professional Interests:
computer networking

 

Watch this Author's files

 

Files Posted by Anh-Dung View all
  • 1 - 5 of
  • 6
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 12 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... 18 0
07 Jan 2013 Breath First Search Breath First Search algorithm to find shortest paths in a network Author: Anh-Dung Nguyen bfs, graph, shortest path, network 24 0
07 Jan 2013 Temporal Graph Visualization Visualize the evolution of a temporal graph Author: Anh-Dung Nguyen dynamic network, temporal graphs, visualization 6 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 11 0
Comments and Ratings by Anh-Dung
  • 1 - 1 of
  • 1
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's Files View all
  • 1 - 2 of
  • 2
Updated File Comment by Comments Rating
29 Oct 2012 k-clique algorithm k-clique community detection algorithm Author: Anh-Dung Nguyen Nguyen, Anh-Dung

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

Top Tags Applied by Anh-Dung
  • 1 - 5 of
  • 22
temporal graphs, dynamic networks, graph, network, allpairs
Files Tagged by Anh-Dung View all
  • 1 - 5 of
  • 6
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 12 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... 18 0
07 Jan 2013 Breath First Search Breath First Search algorithm to find shortest paths in a network Author: Anh-Dung Nguyen bfs, graph, shortest path, network 24 0
07 Jan 2013 Temporal Graph Visualization Visualize the evolution of a temporal graph Author: Anh-Dung Nguyen dynamic network, temporal graphs, visualization 6 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 11 0

Contact us