523 search results - page 80 / 105 » Decidability of string graphs |
120
Voted
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
111
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
134
click to vote
WLP
2004
Springer
15 years 8 months ago
2004
Springer
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...
134
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
122
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adapt...