18 citations · 50 across the 13 of their papers we have counts for
14 papers
Maximal Independent Sets for Pooling in Graph Neural Networks
Stevan Stanovic, Benoit Gaüzère, Luc Brun
Convolutional Neural Networks (CNNs) have enabled major advances in image classification through convolution and pooling. In particular, image pooling transforms a connected discre…
Maximal Independent Vertex Set applied to Graph Pooling
Stevan Stanovic, Benoit Gaüzère, Luc Brun
Convolutional neural networks (CNN) have enabled major advances in image classification through convolution and pooling. In particular, image pooling transforms a connected discret…
A new Sinkhorn algorithm with Deletion and Insertion operations
Luc Brun, Benoit Gaüzère, Sébastien Bougleux +1
This technical report is devoted to the continuous estimation of an epsilon-assignment. Roughly speaking, an epsilon assignment between two sets V1 and V2 may be understood as a bi…
Improved local search for graph edit distance
Nicolas Boria, David B. Blumenthal, Sébastien Bougleux +1
The graph edit distance (GED) measures the dissimilarity between two graphs as the minimal cost of a sequence of elementary operations transforming one graph into another. This mea…
Upper Bounding the Graph Edit Distance Based on Rings and Machine Learning
David B. Blumenthal, Johann Gamper, Sébastien Bougleux +1
The graph edit distance (GED) is a flexible distance measure which is widely used for inexact graph matching. Since its exact computation is NP-hard, heuristics are used in practic…
Generalized Median Graph via Iterative Alternate Minimizations
Nicolas Boria, S'ebastien Bougleux, Benoit Gaüzère +1
Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs.…