We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...