The paper provides an alternative, more efficient leader-election technique for any graph labeled by a shortest path interval routing scheme.

The introduction describes the problem and presents some routing basics, along with references to related literature. The authors proceed by presenting some preliminary claims and results. They elaborate further by treating interval routing schemes, including strict and linear, and related problems.

The paper contains a significant amount of theorems, proofs, and lemmas. There are a few times that a non-mathematical description would improve the flow of the text and content, but, in general, the authors manage to state their results and their conclusions eloquently. It is certainly a well-rounded presentation with all of the necessary formalisms.

The results can be encapsulated in an improvement from a known O(m+n) bound to O(n). Overall, this paper provides a thorough examination of the proposed routing scheme and proof of the feasibility of such optimization. The subject matter is treated at great depth, and it is obviously targeted to a limited audience interested in applying graph theory in order to solve network problems. Nevertheless, the paper is quite thorough, with supporting theorems, lemmas, and assumptions presented in a well-structured manner.