2911 search results - page 15 / 583 » A Logic of Graph Constraints |
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
RTA
2000
Springer
14 years 1 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
JCO
2000
13 years 9 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
LMCS
2006
13 years 9 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
FSTTCS
2005
Springer
14 years 3 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...