363 search results - page 2 / 73 » Partial Multicuts in Trees |
CSR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We show that partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploi...
SSPR
2010
Springer
13 years 3 months ago
2010
Springer
IMAGAPP
2010
13 years 3 months ago
2010
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...