G. Bonfante and B. Guillaume, Non-simplifying graph rewriting termination, Proceedings of the 7th International Workshop on Computing with Terms and Graphs (TERMGRAPH), pp.4-16, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00921053

H. J. Bruggink, B. König, D. Nolte, and H. Zantema, Proving termination of graph transformation systems using weighted type graphs over semirings, Proceedings of the 8th International Conference on Graph Transformation (ICGT), held as part of STAF 2015, vol.9151, pp.52-68, 2015.

N. Dershowitz, Termination of rewriting, J. Symb. Comput, vol.3, pp.69-115, 1987.

N. Dershowitz and J. P. Jouannaud, Drags: A simple algebraic framework for graph rewriting, Proceedings of the 7th International Workshop on Computing with Terms and Graphs (TERMGRAPH), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01853836

N. Dershowitz and J. P. Jouannaud, Drags: An algebraic framework for graph rewriting, TCS, 2018.
DOI : 10.1016/j.tcs.2019.01.029
URL : https://hal.inria.fr/hal-01853836/file/GraphRewritingTG-Final.pdf

V. Dotsenko and M. Bremner, Algebraic Operads: An Algorithmic Companion, 2016.

A. Habel, H. Kreowski, and D. Plump, Jungle evaluation, Fundam. Inform, vol.15, pp.37-60, 1991.
DOI : 10.1007/3-540-50325-0_5

J. P. Jouannaud and A. Rubio, Polymorphic higher-order recursive path orderings, J. ACM, vol.54, 2007.
DOI : 10.1145/1206035.1206037
URL : http://www.lsi.upc.es/~albert/papers/jouannaudrubioJACM.pdf

D. Plump, Simplification orders for term graph rewriting, Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97), vol.1295, pp.458-467, 1997.

A. Rubio, A fully syntactic AC-RPO, Inf. Comput, vol.178, pp.515-533, 2002.