1447 search results - page 16 / 290 » Graphs and Path Equilibria |
94
Voted
WCET
2007
15 years 3 months ago
2007
We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
147
Voted
FOCS
2010
IEEE
14 years 12 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
106
click to vote
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
123
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
103
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...