523 search results - page 56 / 105 » Decidability of string graphs |
127
click to vote
HYBRID
2009
Springer
15 years 1 months ago
2009
Springer
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...
125
Voted
FOSSACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
142
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
133
Voted
CPAIOR
2004
Springer
15 years 7 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
136
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...