2125 search results - page 78 / 425 » On Graph Complexity |
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
COCOON
2005
Springer
15 years 3 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...
102
click to vote
DAC
1999
ACM
15 years 2 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
AIPS
2009
14 years 11 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
LPAR
2010
Springer
14 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...