677 search results - page 118 / 136 » Bipartite roots of graphs |
EMMCVPR
2001
Springer
15 years 4 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
114
click to vote
IDEAS
2000
IEEE
15 years 4 months ago
2000
IEEE
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...
102
click to vote
COMPGEOM
1990
ACM
15 years 3 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
114
click to vote
GBRPR
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
IPCO
2007
15 years 1 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...