1327 search results - page 73 / 266 » Path following algorithm for the graph matching problem |
132
click to vote
WABI
2010
Springer
15 years 3 days ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
132
click to vote
COCO
1998
Springer
15 years 6 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
191
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Density of moles is a strong predictor of malignant
melanoma. Some dermatologists advocate periodic fullbody
scan for high-risk patients. In current practice, physicians
compare...
138
click to vote
ESA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
102
click to vote
DIAGRAMS
2006
Springer
15 years 5 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...