  We state the Problem of Knot Identification as a way to achieve consensus in
dynamic networks. The network adversary is asynchronous and not oblivious. The
network may be disconnected throughout the computation. We determine the
necessary and sufficient conditions for the existence of a solution to the Knot
Identification Problem: the knots must be observable by all processes and the
first observed knot must be the same for all processes. We present an algorithm
KIA that solves it. We conduct KIA performance evaluation.
