1327 search results - page 88 / 266 » Path following algorithm for the graph matching problem |
154
Voted
WINE
2010
Springer
14 years 11 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
121
Voted
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
97
Voted
JDA
2007
15 years 1 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
107
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
118
click to vote
BPM
2005
Springer
15 years 7 months ago
2005
Springer
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...