Mohlo by se vám také líbit

Více informací o knize Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 121 bodů

Anotace knihy

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 graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem.

Parametry knihy

• Plný název: Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs
• Podnázev: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio
• Autor: Ahmed Sh. Arefin
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 72
• EAN: 9783639196849
• ID: 06827751
• Nakladatelství: VDM Verlag Dr. Müller
• Hmotnost: 126 g
• Rozměry: 220 × 151 × 7 mm
• Rok vydání: 2009

Oblíbené z jiného soudku

---

---

---