Pierre-Louis Giscard

Actif depuis 2017

A soumis

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

environ 5 ans il y a | 1 téléchargement |

A soumis

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

environ 5 ans il y a | 3 téléchargements |

A soumis

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

plus de 5 ans il y a | 2 téléchargements |

A soumis

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

plus de 5 ans il y a | 1 téléchargement |

A soumis

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

plus de 5 ans il y a | 1 téléchargement |

A soumis

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

plus de 5 ans il y a | 2 téléchargements |

A soumis

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

plus de 5 ans il y a | 1 téléchargement |

A soumis

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

plus de 5 ans il y a | 3 téléchargements |

Personal Best Downloads Level 1