263 search results - page 1 / 53 » On the Containment of Forbidden Patterns Problems |
CP
2010
Springer
14 years 5 months ago
2010
Springer
AAAI
2012
12 years 8 months ago
2012
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
CORR
2007
Springer
14 years 6 months ago
2007
Springer
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problem...
ISAAC
2007
Springer
15 years 18 days ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...