886 search results - page 63 / 178 » Reasoning with contextual graphs |
137
click to vote
CADE
2001
Springer
15 years 8 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
148
click to vote
ENTCS
2008
15 years 4 months ago
2008
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. It is based on Augur 1, a tool which can analyze graph transforma...
103
click to vote
JGT
2006
15 years 4 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
146
Voted
RP
2010
Springer
15 years 1 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
139
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...