Overview

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.

Full Product Details

9781332088690

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available