Edith Cohen, Nimrod Megiddo. Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 15-17 May 1989, Seattle, Washington, USA. pages 523-534, ACM, 1989.
@inproceedings{CohenM89,
title = {Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version)},
author = {Edith Cohen and Nimrod Megiddo},
year = {1989},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CohenM89},
cites = {0},
citedby = {0},
pages = {523-534},
booktitle = {Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 15-17 May 1989, Seattle, Washington, USA},
publisher = {ACM},
}