488 search results - page 26 / 98 » Automorphic Decompositions of Graphs |
DM
2000
13 years 7 months ago
2000
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
DM
2008
13 years 7 months ago
2008
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...