Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs
 |
|
Описание:
This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel...Похожие книги
 | Probabilistic safety assessment in the chemical and nuclear industries Автор: Ralph Fullwood Attended Texas Technological University Harvard University University of Pennsylvania and Rensselaer Polytechnic Institute. Год: 1999 |
 | Erica Arborea Год: 2011 |
 | Arterial tree Год: 2011 |
 | Dove Tree Год: 2011 |
 | The Lexus and the Olive Tree Автор: Thomas L. Friedman Год: 2000 |