38 citations · 77 across the 6 of their papers we have counts for
1 paper · 1 filter
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.…