Ahmed Shamsul Arefin
(Institute of Information and Communication Technology, BUET, 2008-01)
This thesis deals with the NP-Completeness and an approximation algorithm for
finding minimum edge ranking spanning tree (MERST) on series-parallel graphs.
An edge-ranking of a graph G is a labeling of its edges with ...