Search Results for author: Pierre-Louis Giscard

Found 3 papers, 1 papers with code

Computing Optimal Assignments in Linear Time for Approximate Graph Matching

no code implementations29 Jan 2019 Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson

In this paper, we develop an algorithm which can find an optimal assignment in linear time when the cost function between objects is represented by a tree distance.

Graph Matching

A general purpose algorithm for counting simple cycles and simple paths of any length

1 code implementation16 Dec 2016 Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson

These comparisons show that the algorithm described here is the best general purpose algorithm for the class of graphs where $(\ell^{\omega-1}\Delta^{-1}+1) |S_\ell|\leq |\text{Cycle}_\ell|$, with $|\text{Cycle}_\ell|$ the total number of simple cycles of length at most $\ell$, including backtracks and self-loops.

Data Structures and Algorithms Discrete Mathematics Combinatorics 68Q25, 68W40, 05C30, 05C38, 05C22

Cannot find the paper you are looking for? You can Submit a new open access paper.