A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On an edge ranking problem of trees and graphs
1991
Discrete Applied Mathematics
Iyer, A.V., H.D. Ratliff and G. Vijayan, On an edge ranking problem of trees and graphs, Discrete Applied Mathematics 30 (1991) 43-52. A k-edge ranking of an undirected graph is a labeling of the edges of the graph with integers 1,2,. , k, with the property that all paths between two edges with the same label i contain an edge with label j> i. The edge ranking problem is that of finding the smallest k for which a graph has a k-edge ranking. This problem is useful in the optimization of the
doi:10.1016/0166-218x(91)90012-l
fatcat:jszvuvywc5fvfjqkymg3b676yu