@inproceedings{1badd0c1aae5478e92b58dca701fe48b,
title = "A distributed algorithm for knot detection in a distributed graph",
abstract = "Knot detection in a distributed graph is an important problem and finds applications in several areas such as packet switching, distributed simulation, and distributed database systems. The paper presents a distributed algorithm to efficiently detect the existence of a knot in a distributed graph. The algorithm requires 2e messages and a delay or 2(d+1) message hops to detect if a node in a distributed graph is in a knot (e is the number of edges in the reachable part of the distributed graph and d is its diameter). A significant advantage of this algorithm is that it not only detects if a node is in a knot but also finds exactly which nodes are involved in the knot.",
keywords = "Application software, Buffer storage, Clustering algorithms, Computer science, Database systems, Detection algorithms, Distributed algorithms, Packet switching, Switches, System recovery",
author = "D. Manivannan and M. Singhal",
year = "2002",
doi = "10.1109/ICPP.2002.1040905",
language = "English",
series = "Proceedings of the International Conference on Parallel Processing",
pages = "485--492",
editor = "Abdelrahman, {Tarek S.}",
booktitle = "Proceedings - International Conference on Parallel Processing, ICPP 2002",
note = "International Conference on Parallel Processing, ICPP 2002 ; Conference date: 18-08-2002 Through 21-08-2002",
}