19 citations · 30 across the 4 of their papers we have counts for
5 papers
Algebraic foundations for qualitative calculi and networks
Robin Hirsch, Marcel Jackson, Tomasz Kowalski
A qualitative representation is like an ordinary representation of a relation algebra, but instead of requiring , as we do for ordinary representations, we…
A finer reduction of constraint problems to digraphs
Jakub Bulín, Dejan Delic, Marcel Jackson +1
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph…
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
Tim Dwyer, Christopher Mears, Kerri Morgan +3
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbour…
On the reduction of the CSP dichotomy conjecture to digraphs
Jakub Bulin, Dejan Delic, Marcel Jackson +1
It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a re…
Complexity and polymorphisms for digraph constraint problems under some basic constructions
Marcel Jackson, Tomasz Kowalski, Todd Niven
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymo…