Article citationsMore>>

Cohen, E. and Megiddo, N. (1989) Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs. Prodceedings of 21st Annual ACM Symposium on Theory of Computing, Seattle, 14-17 May 1989, 523-534.
https://doi.org/10.1145/73007.73057

has been cited by the following article:

SCIRP Newsletter
Copyright © 2006-2026 Scientific Research Publishing Inc. All Rights Reserved.
Top