151 search results - page 17 / 31 » Derandomized Squaring of Graphs |
COMBINATORICS
2007
13 years 6 months ago
2007
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
CGF
2002
13 years 6 months ago
2002
We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models 16. As a result, semiorthogonal wavelet systems have al...
EJC
2008
13 years 6 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...