2 citations · 3 across the 4 of their papers we have counts for
3 papers · 1 filter
Towards Reformulating Essence Specifications for Robustness
Özgür Akgün, Alan M. Frisch, Ian P. Gent +4
The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made. Essence specifications are…
Permutation group algorithms based on directed graphs
Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker +1
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections…
An exact formula for percolation on higher-order cycles
Peter Mann, V Anne Smith, John Mitchell +2
We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following b…