1327 search results - page 99 / 266 » Path following algorithm for the graph matching problem |
150
Voted
ALGORITHMICA
2010
15 years 6 days ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
124
Voted
CIAC
2000
Springer
15 years 6 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
PAMI
2006
15 years 1 months ago
2006
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
ISPD
1999
ACM
15 years 6 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
142
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...