Statistics
8 Files
RANK
N/A
of 300,343
REPUTATION
N/A
CONTRIBUTIONS
0 Questions
0 Answers
ANSWER ACCEPTANCE
0.00%
VOTES RECEIVED
0
RANK
8,221 of 20,926
REPUTATION
106
AVERAGE RATING
4.50
CONTRIBUTIONS
8 Files
DOWNLOADS
10
ALL TIME DOWNLOADS
917
RANK
of 168,172
CONTRIBUTIONS
0 Problems
0 Solutions
SCORE
0
NUMBER OF BADGES
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Highlights
AVERAGE NO. OF LIKES
Feeds
Submitted
SubgraphEntropy(G,prec)
Fast algorithm for computing graph entropy, as calculated from its induced subgraphs.
7 years ago | 1 download |
Submitted
SubgraphCentrality(A,L0,SaveCoordinates)
Calculates the centrality (fraction of intercepted flows) of all subgraphs on L vertices of a graph.
8 years ago | 1 download |
Submitted
Weisfeiler-Lehman Optimal Assignment Kernel
Suit of algorithms implementing the Weisfeiler-Lehman Optimal Assignment kernel on graphs
8 years ago | 1 download |
Submitted
FlowFraction(A,H)
Calculates the fraction of all network flows intercepted by a cycle c or subgraph H of a graph
8 years ago | 2 downloads |
Submitted
Labelled paths and cycles counting
Counts the number of labelled paths and cycles in a graph
8 years ago | 1 download |
Submitted
CycleCount(A,L0)
Algorithm for counting simple cycles of any length on any (weighted directed) network.
8 years ago | 1 download |
Submitted
PathCount(A,L0)
Algorithm for counting simple paths of any length on any (weighted directed) network.
8 years ago | 1 download |
Submitted
CyclePathCount(A,L0)
Algorithm for counting simple paths & cycles of any length on any (weighted directed) network.
8 years ago | 2 downloads |
