Pierre-Louis Giscard

Aktiv seit 2017

Followers: 0 Following: 0

Gesendet

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

mehr als 8 Jahre vor | 69 Downloads |

0.0 / 5

Gesendet

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

mehr als 8 Jahre vor | 90 Downloads |

0.0 / 5

Gesendet

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

fast 9 Jahre vor | 103 Downloads |

5.0 / 5

Gesendet

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

fast 9 Jahre vor | 61 Downloads |

0.0 / 5

Gesendet

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

fast 9 Jahre vor | 57 Downloads |

0.0 / 5

Gesendet

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

fast 9 Jahre vor | 398 Downloads |

4.0 / 5

Gesendet

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

etwa 9 Jahre vor | 67 Downloads |

0.0 / 5

Gesendet

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

etwa 9 Jahre vor | 90 Downloads |

0.0 / 5