1327 search results - page 60 / 266 » Path following algorithm for the graph matching problem |
103
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
128
click to vote
JAL
2006
15 years 1 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
148
click to vote
ILP
2007
Springer
15 years 7 months ago
2007
Springer
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
132
click to vote
JCO
2008
15 years 1 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
MST
2010
15 years 4 days ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...