330 search results - page 44 / 66 » Compressing Bounded Degree Graphs |
JGT
2008
14 years 9 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
IACR
2011
13 years 9 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...