2031 search results - page 66 / 407 » On Tree-Constrained Matchings and Generalizations |
100
click to vote
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
AAAI
2007
15 years 3 days ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
ITSSA
2006
14 years 9 months ago
2006
: General purpose workflow management systems are often unable to match user requirements of a particular application. In many points of the workflow the user has to take decisions...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can significantly improve the quality of the preci...