139 search results - page 23 / 28 » Computing the Tutte Polynomial on Graphs of Bounded Clique-W... |
95
Voted
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
100
Voted
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
97
Voted
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
118
click to vote
PODS
2001
ACM
15 years 11 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...