In the List H- Homomorphism Problem, for a graph H that is a parameter of the problem, an instance consists of an undirected graph G with a list constraint $${L(v) \subseteq V(H)}$$L(v)⊆V(H) for each variable $${v \in V(G)}$$vźV(G), and the objective is ...
This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B63(1995), 153 158), who proved that the list edge chromatic number list(G) of a bipartite multigraphGequals its edge chromatic number (G). It is now proved here that if ...
The Winnow class of on-line linear learning algorithms [10, 11] was designed to be attribute-efficient. When learning with many irrelevant attributes, Winnow makes a number of errors that is only logarithmic in the number of total attributes, compared ...
Association for Computational Linguistics
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in