73 search results - page 4 / 15 » Labeling Schemes for Vertex Connectivity |
ICIP
1997
IEEE
14 years 9 months ago
1997
IEEE
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...
LREC
2010
13 years 9 months ago
2010
One of the essential functions of natural language is to talk about spatial relationships between objects. Linguistic constructs can express highly complex, relational structures ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
TON
2008
13 years 7 months ago
2008
Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and there...
DM
2008
13 years 7 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...