Wyniki wyszukiwania:

This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems. The authors...

This book contains collected lectures given at the 1990 ALCOM Spring School of Parallel Computation. The motivation for the school was to provide an introduction for graduate students to topics at the leading edge of research in this very active area of computer science. Topics covered include PRAM algorithmics, general purpose computation, systolic and distributed algorithms, distributed memory models, as well as issues from practical parallel computation. The papers by some of the leading figures in this field have been carefully edited to make a coherent and unique introduction to the...

This book combines traditional graph theory with the matroid view of graphs in order to throw light on the mathematical approach to network analysis. The authors examine in detail two dual structures associated with a graph, namely circuits and cutsets. These are strongly dependent on one another and together constitute a third, hybrid, vertex-independent structure called a graphoid, whose study is here termed hybrid graph theory. This approach has particular relevance for network analysis. The first account of the subject in book form, the text includes many new results as well as the...