Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio - Couverture souple

Arefin, Ahmed Shamsul

9783639196849: Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio

Couverture souple

ISBN 10 : 3639196848 ISBN 13 : 9783639196849

Editeur : VDM Verlag, 2009

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

3 Neuf

De EUR 39,24

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

Pr�sentation de l'�diteur

Biographie de l'auteur

Ahmed Shamsul Arefin is a PhD candidate, Computer Science at The University of Newcastle, Australia. He is currently working at the Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine. His interests centre on large scale graph algorithmics and bioinformatics. He has recieved MSc. from BUET and BSc. from CUET, Bangladesh.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: VDM Verlag
Date d'�dition: 2009
Langue: anglais
ISBN 10: 3639196848
ISBN 13: 9783639196849
Reliure: Broch�
Nombre de pages: 72
Coordonn�es du fabricant: non disponible
Personne responsable: non disponible

Acheter neuf

Afficher cet article

EUR 39,24

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

R�sultats de recherche pour Minimum Edge-Ranking Spanning Tree Problem of Series-Paralle...

Image fournie par le vendeur

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

Ahmed Shamsul Arefin

Edit� par VDM Verlag Dr. M�ller, 2009

ISBN 10 : 3639196848 ISBN 13 : 9783639196849

Neuf Kartoniert / Broschiert

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Arefin Ahmed ShamsulAhmed Shamsul Arefin is a PhD candidate, Computer Science at The University of Newcastle, Australia. He is currently working at the Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine. Hi. N� de r�f. du vendeur 4966189

Contacter le vendeur