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: 50.88 EUR
Availability: InStock

Finding NP Completeness, Efficient Approximation Algorithm and the Ratio

Автор: Ahmed Sh. Arefin

Език:

Корици: С меки корици

Издател: VDM Verlag Dr. Müller

Наличност: Налично при издателя, по поръчка

Изпращаме след 17-27 дни

50.88 € 99.51 лв

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

Информация за книгата

Автор

Ahmed Sh. Arefin

Език

Английски език

Корици

Книга - С меки корици

Издадена

2009

страници

EAN

9783639196849

Enbook ID

06827751

Издател

VDM Verlag Dr. Müller

Теглоt

126

Размери

151 x 220 x 7

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също