4137 search results - page 201 / 828 » On the number of matchings of a tree |
178
click to vote
TMM
2008
15 years 6 months ago
2008
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
196
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
176
click to vote
ESWS
2004
Springer
16 years 6 hour ago
2004
Springer
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
175
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
200
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...