523 search results - page 82 / 105 » Decidability of string graphs |
126
click to vote
ENTCS
2008
15 years 3 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
111
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
118
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
138
click to vote
DISOPT
2007
15 years 3 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
118
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...