1383 search results - page 120 / 277 » On the Complexity of the Interlace Polynomial |
157
click to vote
ESA
2007
Springer
16 years 18 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
178
click to vote
LACL
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
169
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
188
click to vote
MST
2011
15 years 1 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...