202 search results - page 30 / 41 » Large-Girth Roots of Graphs |
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
— The paper focuses on leader-follower formations of nonholonomic mobile robots. A formation control alternative to those existing in the literature is introduced. We show that t...
EMMCVPR
2001
Springer
15 years 2 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...
IDEAS
2000
IEEE
15 years 2 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...
COMPGEOM
1990
ACM
15 years 1 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...