A. V. Kelarev. A Polynomial Algorithm for Codes Based on Directed Graphs. In Joachim Gudmundsson, C. Barry Jay, editors, Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings. Volume 51 of CRPIT, pages 87-92, Australian Computer Society, 2006. [doi]
@inproceedings{Kelarev06,
title = {A Polynomial Algorithm for Codes Based on Directed Graphs},
author = {A. V. Kelarev},
year = {2006},
url = {http://crpit.com/abstracts/CRPITV51Kelarev.html},
tags = {rule-based, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Kelarev06},
cites = {0},
citedby = {0},
pages = {87-92},
booktitle = {Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings},
editor = {Joachim Gudmundsson and C. Barry Jay},
volume = {51},
series = {CRPIT},
publisher = {Australian Computer Society},
isbn = {1-920682-33-3},
}