1327 search results - page 76 / 266 » Path following algorithm for the graph matching problem |
122
click to vote
ESOP
2006
Springer
15 years 5 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
110
click to vote
APPROX
2000
Springer
15 years 6 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
142
click to vote
CIARP
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
135
click to vote
CIKM
2010
Springer
15 years 11 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
91
Voted
SIAMJO
2002
15 years 1 months ago
2002
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...