4137 search results - page 15 / 828 » On the number of matchings of a tree |
WG
2009
Springer
14 years 2 months ago
2009
Springer
ALGORITHMICA
2008
13 years 7 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
EJC
2010
13 years 7 months ago
2010
PODS
2008
ACM
14 years 7 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...