1274 search results - page 68 / 255 » Graph lambda theories |
DAC
2006
ACM
14 years 10 months ago
2006
ACM
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
AGTIVE
1999
Springer
14 years 1 months ago
1999
Springer
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
ENTCS
2008
13 years 9 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...