Write an algorithm that computes the depth-first search in terval labeling scheme (see Subsection 4.4. 2) for an arbitrary connected net work. Can it be done in O(N) time units? Can it be done using O(N) messages?
Text Book: Introduction to Distributed Algorithms By Gerard Tel.