Több mint 4 millió cím angol és más nyelveken! Fedezd fel új történetedet még ma!

Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs

Name: Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs
Brand: VDM Verlag Dr. Müller
SKU: 9783639196849
Price: 17139 HUF
Availability: InStock

Finding NP Completeness, Efficient Approximation Algorithm and the Ratio

Szerző: Ahmed Sh. Arefin

Nyelv:

Kötés: Puha kötésű

Kiadó: VDM Verlag Dr. Müller

Elérhetőség: Kiadói készleten rendelésre

Küldés 17-27 napon belül

17 139 Ft

This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ran...

Információk a könyvről

Szerző

Ahmed Sh. Arefin

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2009

oldal

EAN

9783639196849

Enbook ID

06827751

Kiadó

VDM Verlag Dr. Müller

Súly

126

Méretek

151 x 220 x 7

Teljes leírás

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.