120 citations · 232 across the 12 of their papers we have counts for
15 papers
Computing Optimal Assignments in Linear Time for Approximate Graph Matching
Nils M. Kriege, Pierre-Louis Giscard, Franka Bause +1
Finding an optimal assignment between two sets of objects is a fundamental problem arising in many applications, including the matching of `bag-of-words' representations in natural…
A Centrality Measure for Cycles and Subgraphs II
P-L. Giscard, R. C. Wilson
In a recent work we introduced a measure of importance for groups of vertices in a complex network. This centrality for groups is always between 0 and 1 and induces the eigenvector…
The All-Paths and Cycles Graph Kernel
P. -L. Giscard, R. C. Wilson
With the recent rise in the amount of structured data available, there has been considerable interest in methods for machine learning with graphs. Many of these approaches have bee…
Cycle-centrality in complex networks
Pierre-Louis Giscard, Richard C. Wilson
Networks are versatile representations of the interactions between entities in complex systems. Cycles on such networks represent feedback processes which play a central role in sy…
A general purpose algorithm for counting simple cycles and simple paths of any length
Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson
We describe a general purpose algorithm for counting simple cycles and simple paths of any length on a (weighted di)graph on vertices and edges, achieving a time com…
An Hopf algebra for counting simple cycles
Pierre-Louis Giscard, Paul Rochet, Richard Wilson
Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the…