Fast Parallel Algorithms for Chordal Graphs
Author : Joseph Naor
Publisher :
Page : 32 pages
File Size : 27,91 MB
Release : 1987
Category : Algorithms
ISBN :
Author : Joseph Naor
Publisher :
Page : 32 pages
File Size : 27,91 MB
Release : 1987
Category : Algorithms
ISBN :
Author : Chin-Wen Ho
Publisher :
Page : pages
File Size : 37,36 MB
Release : 1988
Category :
ISBN :
Author : Marek Karpiński
Publisher : Oxford University Press
Page : 228 pages
File Size : 37,60 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 : 44,17 MB
Release : 1985
Category : Algorithms
ISBN :
Author : Eric Stewart Kirsch
Publisher :
Page : 130 pages
File Size : 26,24 MB
Release : 1989
Category : Algorithms
ISBN :
Author : Danny Soroker
Publisher :
Page : 238 pages
File Size : 20,33 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 : Philip Nathan Klein
Publisher :
Page : 58 pages
File Size : 43,45 MB
Release : 1991
Category : Graph theory
ISBN :
The key to these efficient sequential and parallel solutions is finding a perfect elimination ordering. In the latter part of this chapter, we define a framework for finding an elimination ordering by successive refinement. Working within this framework, we explain the sequential algorithm due to Rose, Tarjan, and Lueker. Then we describe the parallel algorithm due to Klein."
Author : Elias Dahlhaus
Publisher :
Page : 14 pages
File Size : 13,9 MB
Release : 1993
Category : Graph theory
ISBN : 9780867586701
Author : John H. Reif
Publisher : Morgan Kaufmann Publishers
Page : 1032 pages
File Size : 25,47 MB
Release : 1993
Category : Computers
ISBN :
Mathematics of Computing -- Parallelism.
Author : Rüdiger Reischuk
Publisher : Springer Science & Business Media
Page : 638 pages
File Size : 12,4 MB
Release : 1997-02-21
Category : Computers
ISBN : 9783540626169
This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.