1986 search results - page 13 / 398 » Path Separability of Graphs |
WCET
2007
13 years 9 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 ...
FOCS
2010
IEEE
13 years 6 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...
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
