Items related to Efficient Implementation of a Shifting Algorithm (Classic...
Synopsis
Excerpt from Efficient Implementation of a Shifting Algorithm
The improvement is mainly due to a data structure which suggests a succinct representation for subsets of edges, of a given tree. That preserves the interrelation between the edges on the tree. Section 2 introduces both the min-max tree partitioning problem and high-level description of the shifting algorithm which was given in [bps]. Section 3 presents an implementation scheme of the algorithm which. Forms an intermediate-level description of the algorithm Section 4 introduces two data - structures. It is then shown how to utilize them by the intermediate level description to form a low level implementation of the algorithm.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2024
- ISBN 10 1332088694
- ISBN 13 9781332088690
- BindingPaperback
- LanguageEnglish
- Number of pages25
Buy New
View this item
US$ 17.05
Shipping:
FREE
From United Kingdom to U.S.A.
Search results for Efficient Implementation of a Shifting Algorithm (Classic...
Seller Image
Efficient Implementation of a Shifting Algorithm (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book delves into the efficient implementation of a shifting algorithm for solving tree partitioning problems. The approach used in this book is a top-down greedy technique, in contrast to the traditional bottom-up approach. It introduces a novel data structure that elegantly represents subsets of edges on a given tree while preserving their interrelation, leading to a significant improvement in the algorithm's complexity. The book provides a detailed description of the algorithm, from its high-level conception to its low-level implementation. It covers topics such as min-max tree partitioning, shifting algorithm techniques, junction tree data structures, and cut-free data structures. Through these concepts, the book offers valuable insights into designing efficient algorithms for tree partitioning problems. Its findings are of great significance in the field of computer science, particularly in the realm of graph theory and algorithm design. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332088690_0
Quantity: Over 20 available
Stock Image
Efficient Implementation of a Shifting Algorithm Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781332088690
Quantity: 15 available
Stock Image
Efficient Implementation of a Shifting Algorithm Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781332088690
Quantity: 15 available