3897 search results - page 74 / 780 » complexity 2010 |
IWPC
2010
IEEE
13 years 8 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
LPAR
2010
Springer
13 years 8 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...
ORDER
2010
13 years 8 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 ...
WG
2010
Springer
13 years 8 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...
WIOPT
2010
IEEE
13 years 8 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 [...