29908 search results - page 382 / 5982 » On the Complexity of |
170
click to vote
LPAR
2010
Springer
15 years 5 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...
175
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
215
click to vote
ORDER
2010
15 years 5 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
175
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
148
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...