  Determining whether nodes can be localized, called localizability detection,
is a basic work in network localization. We present a novel approach for
localizability detection given a set of nodes and their connectivity
relationships. The key idea is transforming the problem of detecting three
disjoint paths into a max-flow problem, which can be efficiently solved by
existing algorithms. Furthermore, we prove the correctness of our algorithm.
