Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n + m) messages and O(m + n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is the number of links). This is compared to O(n2) messages needed in the previous published best algorithm. The knot detection algorithm makes use of efficient cycle detection and clustering techniques. Various applications for the knot detection algorithms are presented. In particular, we demonstrate its importance to deadlock detection in store and forward communication networks and in transaction systems. © 1989 IEEE
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Moshe Sidi, Wen-Zu Liu, et al.
IEEE Transactions on Communications
Israel Cidon, Raphael Rom
Computer Networks and ISDN Systems
Israel Cidon, Moshe Sidi
IEEE Trans. Inf. Theory