1447 search results - page 57 / 290 » Graphs and Path Equilibria |
145
click to vote
SIAMDM
1998
15 years 6 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
176
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...
157
click to vote
SWAT
2004
Springer
16 years 4 hour ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
175
click to vote
EJC
2008
15 years 5 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
171
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...