1327 search results - page 169 / 266 » Path following algorithm for the graph matching problem |
102
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
126
click to vote
IJAMCIGI
2010
14 years 8 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
118
Voted
ICRA
1999
IEEE
15 years 6 months ago
1999
IEEE
In future planetary exploration missions, rovers will be required to autonomously traverse challenging environments. Much of the previous work in robot motion planning cannot be s...
113
Voted
ECCC
2006
15 years 1 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...