717 search results - page 48 / 144 » The Viewing Graph |
MKM
2009
Springer
14 years 2 months ago
2009
Springer
Since Mathematics really is about what mathematicians do, in this paper, we will look at the mathematical practice of framing, in which an object of interest is viewed in terms of ...
CATS
2008
13 years 11 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
CSMR
2008
IEEE
14 years 4 months ago
2008
IEEE
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
UC
2005
Springer
14 years 3 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...