Now showing items 1-1 of 1
AN ALGORITHM FOR SOLVING MINIMUM EDGE-RANKING SPANNING TREE PROBLEM ON PARTIAL K-TREES
(Daffodil International University, 2009-01-01)
An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges with the same label i contains an intermediate edge with label j>i. The minimum edge-ranking spanning ...