Computing equivalence classes among the edges of a graph with
F. Aurenhammer and J. Hagauer
For two edges
of a connected graph
denotes the length of a shortest path in
algorithm is presented that computes the equivalence classes induced on
by the transitive closure
. Finding the equivalence classes of
primary step of several graph algorithms.
Reference: F. Aurenhammer and J. Hagauer.
Computing equivalence classes among the edges of a graph with applications.
In Proc. Int'l Conf. Algebraic Graph Theory, page 11, Leibnitz, Austria,