12 citations · 48 across the 12 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 10 cited
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…
cs.DS2015★ 2 cited
Efficient Generation of Stable Planar Cages for Chemistry
Dominique Barth, Olivier David, Franck Quessette +3
In this paper we describe an algorithm which generates all colored planar maps with a good minimum sparsity from simple motifs and rules to connect them. An implementation of this…