Papers
Topics
Authors
Recent
Search
2000 character limit reached

Testing List H-Homomorphisms

Published 16 Jun 2011 in cs.DS | (1106.3126v1)

Abstract: Let HH be an undirected graph. In the List HH-Homomorphism Problem, given an undirected graph GG with a list constraint L(v)⊆V(H)L(v) \subseteq V(H) for each variable v∈V(G)v \in V(G), the objective is to find a list HH-homomorphism f:V(G)→V(H)f:V(G) \to V(H), that is, f(v)∈L(v)f(v) \in L(v) for every v∈V(G)v \in V(G) and (f(u),f(v))∈E(H)(f(u),f(v)) \in E(H) whenever (u,v)∈E(G)(u,v) \in E(G). We consider the following problem: given a map f:V(G)→V(H)f:V(G) \to V(H) as an oracle access, the objective is to decide with high probability whether ff is a list HH-homomorphism or \textit{far} from any list HH-homomorphisms. The efficiency of an algorithm is measured by the number of accesses to ff. In this paper, we classify graphs HH with respect to the query complexity for testing list HH-homomorphisms and show the following trichotomy holds: (i) List HH-homomorphisms are testable with a constant number of queries if and only if HH is a reflexive complete graph or an irreflexive complete bipartite graph. (ii) List HH-homomorphisms are testable with a sublinear number of queries if and only if HH is a bi-arc graph. (iii) Testing list HH-homomorphisms requires a linear number of queries if HH is not a bi-arc graph.

Authors (1)
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.