Tanzima Hashem
(Department of Computer Science and Engineering, BUET, 2006-06)
This thesis deals with an approximation algorithm for finding edge-rankings
of series-parallel graphs. An edge-ranking of a graph G is a labeling of its edges
with positive integers such that every path between two edges ...