96 search results - page 3 / 20 » New Plain-Exponential Time Classes for Graph Homomorphism |
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
DAM
2010
13 years 5 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
CSR
2008
Springer
13 years 5 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...