Sciweavers

234 search results - page 3 / 47
» Isolation, Matching, and Counting
Sort
View
208
Voted
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 4 months ago
Counting Twig Matches in a Tree
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...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
137
Voted
CORR
2012
Springer
193views Education» more  CORR 2012»
13 years 11 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
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...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
108
Voted
STOC
2007
ACM
104views Algorithms» more  STOC 2007»
16 years 3 months ago
Simple deterministic approximation algorithms for counting matchings
Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C...
109
Voted
WG
2009
Springer
15 years 10 months ago
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
CADE
1994
Springer
15 years 7 months ago
The Complexity of Counting Problems in Equational Matching
Miki Hermann, Phokion G. Kolaitis