4137 search results - page 111 / 828 » On the number of matchings of a tree |
177
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
176
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
198
click to vote
DM
2002
15 years 6 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
152
click to vote
PAMI
2008
15 years 6 months ago
2008
Suppose a set of arbitrary (unlabeled) images contains frequent occurrences of 2D objects from an unknown category. This paper is aimed at simultaneously solving the following rel...