Incremental Pattern Matching for the Efficient Computation of Transitive Closure

Gábor Bergmann, István Ráth, Tamás Szabó, Paolo Torrini, Dániel Varró. Incremental Pattern Matching for the Efficient Computation of Transitive Closure. In Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, Grzegorz Rozenberg, editors, Graph Transformations - 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings. Volume 7562 of Lecture Notes in Computer Science, pages 386-400, Springer, 2012. [doi]

Authors

Gábor Bergmann

This author has not been identified. Look up 'Gábor Bergmann' in Google

István Ráth

This author has not been identified. Look up 'István Ráth' in Google

Tamás Szabó

This author has not been identified. Look up 'Tamás Szabó' in Google

Paolo Torrini

This author has not been identified. Look up 'Paolo Torrini' in Google

Dániel Varró

This author has not been identified. It may be one of the following persons: Look up 'Dániel Varró' in Google