9783639196849 - minimum edge-ranking spanning tree problem of series-parallel graphs: finding np completeness, efficient approximation algorithm and the ratio di arefin, ahmed shamsul (4 risultati)
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 97,85
EUR 11,70 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 43,35
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs | Finding NP Completeness, Efficient Approximation Algorithm and the Ratio | Ahmed Sh. Arefin | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639196849 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengerich…er Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 39,24
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Kartoniert / Broschiert. Condizione: 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 Bioinformatic…s, Biomarker Discovery and Information-Based Medicine. Hi.
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,59
EUR 60,62 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 possib…le 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.
