234 search results - page 3 / 47 » Isolation, Matching, and Counting |
156
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
WG
2009
Springer
15 years 4 months ago
2009
Springer
CADE
1994
Springer
15 years 1 months ago
1994
Springer
