photo

Pierre-Louis Giscard


Attivo dal 2017

Followers: 0   Following: 0

Statistica

File Exchange

8 File

RANK
N/A
of 300.900

REPUTAZIONE
N/A

CONTRIBUTI
0 Domande
0 Risposte

ACCETTAZIONE DELLE RISPOSTE
0.00%

VOTI RICEVUTI
0

RANK
8.237 of 21.106

REPUTAZIONE
107

VALUTAZIONE MEDIA
4.50

CONTRIBUTI
8 File

DOWNLOAD
9

ALL TIME DOWNLOAD
920

RANK

of 171.578

CONTRIBUTI
0 Problemi
0 Soluzioni

PUNTEGGIO
0

NUMERO DI BADGE
0

CONTRIBUTI
0 Post

CONTRIBUTI
0 Pubblico Canali

VALUTAZIONE MEDIA

CONTRIBUTI
0 Punti principali

NUMERO MEDIO DI LIKE

  • Personal Best Downloads Level 1
  • 5-Star Galaxy Level 2
  • First Submission

Visualizza badge

Feeds

Visto da

Inviato


SubgraphEntropy(G,prec)
Fast algorithm for computing graph entropy, as calculated from its induced subgraphs.

quasi 8 anni fa | 1 download |

0.0 / 5

Inviato


SubgraphCentrality(A,L0,SaveCoordinates)
Calculates the centrality (fraction of intercepted flows) of all subgraphs on L vertices of a graph.

circa 8 anni fa | 1 download |

0.0 / 5

Inviato


Weisfeiler-Lehman Optimal Assignment Kernel
Suit of algorithms implementing the Weisfeiler-Lehman Optimal Assignment kernel on graphs

oltre 8 anni fa | 1 download |

5.0 / 5

Inviato


FlowFraction(A,H)
Calculates the fraction of all network flows intercepted by a cycle c or subgraph H of a graph

oltre 8 anni fa | 2 download |

0.0 / 5

Inviato


Labelled paths and cycles counting
Counts the number of labelled paths and cycles in a graph

oltre 8 anni fa | 1 download |

0.0 / 5

Inviato


CycleCount(A,L0)
Algorithm for counting simple cycles of any length on any (weighted directed) network.

oltre 8 anni fa | 1 download |

4.0 / 5

Inviato


PathCount(A,L0)
Algorithm for counting simple paths of any length on any (weighted directed) network.

oltre 8 anni fa | 1 download |

0.0 / 5

Inviato


CyclePathCount(A,L0)
Algorithm for counting simple paths & cycles of any length on any (weighted directed) network.

oltre 8 anni fa | 1 download |

0.0 / 5