In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...