Author : Danny Soroker
Publisher :
Page : 238 pages
File Size : 36,60 MB
Release : 1987
Category : Graph theory
ISBN :
Many theorems in graph theory give simple characterizations for testing the existence of objects with certain properties, which can be translated into fast parallel algorithms. However, transforming these tests into algorithms for constructing such objects is often a real challenge. In this thesis we develop fast parallel ("NC") algorithms for several such construction problems.
Author : Marek Karpiński
Publisher : Oxford University Press
Page : 228 pages
File Size : 28,87 MB
Release : 1998
Category : Computers
ISBN : 9780198501626
The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for students at the beginning graduate level, the exposition is largely self-contained and example-driven; prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and will be of interest to researchers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are presented in three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the goals of the book is to show how these three approaches can be combined to develop efficient parallel algorithms. The book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas.
Author : Howard Jeffrey Karloff
Publisher :
Page : 166 pages
File Size : 38,13 MB
Release : 1985
Category : Algorithms
ISBN :
Author : Sridhar Radhakrishnan
Publisher :
Page : 308 pages
File Size : 28,3 MB
Release : 1990
Category : Algorithms
ISBN :
Author : Uwe Naumann
Publisher : CRC Press
Page : 602 pages
File Size : 37,43 MB
Release : 2012-01-25
Category : Computers
ISBN : 1439827354
Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.
Author : Joseph Naor
Publisher :
Page : 32 pages
File Size : 40,41 MB
Release : 1987
Category : Algorithms
ISBN :
Author : Alan Gibbons
Publisher : Cambridge University Press
Page : 280 pages
File Size : 14,12 MB
Release : 1989-11-24
Category : Computers
ISBN : 9780521388412
Mathematics of Computing -- Parallelism.
Author : Chin-Wen Ho
Publisher :
Page : pages
File Size : 49,78 MB
Release : 1988
Category :
ISBN :
Author : Josep Díaz
Publisher : Cambridge University Press
Page : 170 pages
File Size : 16,11 MB
Release : 1997-07-10
Category : Computers
ISBN : 0521431700
Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.
Author : K Erciyes
Publisher : Springer
Page : 475 pages
File Size : 27,4 MB
Release : 2018-04-13
Category : Computers
ISBN : 3319732358
This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed graph algorithms – including algorithms for big data – and an investigation into the conversion principles between the three algorithmic methods. Topics and features: presents a comprehensive analysis of sequential graph algorithms; offers a unifying view by examining the same graph problem from each of the three paradigms of sequential, parallel and distributed algorithms; describes methods for the conversion between sequential, parallel and distributed graph algorithms; surveys methods for the analysis of large graphs and complex network applications; includes full implementation details for the problems presented throughout the text; provides additional supporting material at an accompanying website. This practical guide to the design and analysis of graph algorithms is ideal for advanced and graduate students of computer science, electrical and electronic engineering, and bioinformatics. The material covered will also be of value to any researcher familiar with the basics of discrete mathematics, graph theory and algorithms.
