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]

@inproceedings{BergmannRSTV12,
  title = {Incremental Pattern Matching for the Efficient Computation of Transitive Closure},
  author = {Gábor Bergmann and István Ráth and Tamás Szabó and Paolo Torrini and Dániel Varró},
  year = {2012},
  doi = {10.1007/978-3-642-33654-6_26},
  url = {http://dx.doi.org/10.1007/978-3-642-33654-6_26},
  researchr = {https://researchr.org/publication/BergmannRSTV12},
  cites = {0},
  citedby = {0},
  pages = {386-400},
  booktitle = {Graph Transformations - 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings},
  editor = {Hartmut Ehrig and Gregor Engels and Hans-Jörg Kreowski and Grzegorz Rozenberg},
  volume = {7562},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-33653-9},
}