64 search results - page 2 / 13 » The Complexity of the List Homomorphism Problem for Graphs |
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
CONCUR
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
JGT
2010
13 years 1 days ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
PVLDB
2010
13 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
DAM
2008
13 years 5 months ago
2008
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...