1986 search results - page 163 / 398 » Path Separability of Graphs |
108
Voted
ICPR
2000
IEEE
15 years 6 months ago
2000
IEEE
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
108
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
AAAI
1990
15 years 3 months ago
1990
In this article we present a novel, hybrid graph spatial representation for robot navigation. This representation enables our mobile robot to build a model of its surroundings whi...
102
click to vote
ICIP
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
JCT
2006
15 years 2 months ago
2006
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...