1327 search results - page 98 / 266 » Path following algorithm for the graph matching problem |
119
Voted
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
131
Voted
IWOCA
2010
Springer
14 years 8 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
106
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We study the stereo matching problem for reconstruction of the location of 3D-points on an unknown surface patch from two calibrated identical cameras without using any...
134
click to vote
NETWORKS
2002
15 years 1 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
95
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...