Mohlo by sa vám tiež páčiť

Viac informácií o knihe Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 124 bodov

Anotácia 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.

Parametre knihy

• Celý názov: Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs
• Podnázov: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio
• Autor: Ahmed Sh. Arefin
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 72
• EAN: 9783639196849
• ID: 06827751
• Nakladateľ: VDM Verlag Dr. Müller
• Hmotnosť: 126 g
• Rozmery: 220 × 151 × 7 mm
• Rok vydania: 2009

Obľúbené z iného súdka

---

---

---