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

Arefin, Ahmed Shamsul

Couverture souple

ISBN 10 : 3639196848 ISBN 13 : 9783639196849

Editeur : VDM Verlag, 2009

Synopsis

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.

A propos du livre

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.

Détails de l'édition

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