1650 search results - page 132 / 330 » The HOM problem is decidable |
139
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
133
click to vote
CCIA
2006
Springer
15 years 8 months ago
2006
Springer
In multi-agent systems, individual problem solving capabilities can be improved thanks to the interaction with other agents. In the classification problem solving task each agent i...
124
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
155
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
143
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...