1257 search results - page 151 / 252 » A generalization of Euler's constant |
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
RELMICS
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
UC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
WG
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
ACMICEC
2004
ACM
14 years 2 months ago
2004
ACM
At the present time, the use of mobile technology in business, is becoming an opportunity to generate competitive advantages within organization environments. Mobile technology he...