237 search results - page 6 / 48 » MapReduce for Integer Factorization |
JCT
1998
13 years 9 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
WWW
2010
ACM
14 years 4 months ago
2010
ACM
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has repeatedly shown the usefulness of extracting the interaction structure inside dya...
FCSC
2008
13 years 9 months ago
2008
Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we g...
DAM
2010
13 years 10 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...