723 search results - page 102 / 145 » On the hyperbolicity constant in graphs |
167
click to vote
IWPEC
2009
Springer
16 years 20 days 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...
145
click to vote
SOFSEM
2007
Springer
16 years 6 days ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
162
click to vote
ICW
2005
IEEE
15 years 11 months ago
2005
IEEE
Large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be foreseeable in the near future. Since nodes in such a system commun...
143
click to vote
COCOON
2005
Springer
15 years 11 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...
152
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...