Practical Parallel Algorithms for Chordal Graphs
Author : Eric Stewart Kirsch
Publisher :
Page : 130 pages
File Size : 42,35 MB
Release : 1989
Category : Algorithms
ISBN :
Author : Eric Stewart Kirsch
Publisher :
Page : 130 pages
File Size : 42,35 MB
Release : 1989
Category : Algorithms
ISBN :
Author : Joseph Naor
Publisher :
Page : 32 pages
File Size : 46,8 MB
Release : 1987
Category : Algorithms
ISBN :
Author : Philip Nathan Klein
Publisher :
Page : 58 pages
File Size : 35,33 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 : Chin-Wen Ho
Publisher :
Page : pages
File Size : 17,51 MB
Release : 1988
Category :
ISBN :
Author : Elias Dahlhaus
Publisher :
Page : 14 pages
File Size : 13,2 MB
Release : 1993
Category : Graph theory
ISBN : 9780867586701
Author : John H. Reif
Publisher : Morgan Kaufmann Publishers
Page : 1032 pages
File Size : 24,59 MB
Release : 1993
Category : Computers
ISBN :
Mathematics of Computing -- Parallelism.
Author : Marek Karpiński
Publisher : Oxford University Press
Page : 228 pages
File Size : 23,80 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 : Elias Dahlhaus
Publisher :
Page : 18 pages
File Size : 11,95 MB
Release : 1993
Category : Computer algorithms
ISBN : 9780867586657
Abstract: "Chordal graphs are nothing else than intersection graphs of subtrees of a tree. We present nearly optimal algorithms for certain graph problems if the input graph is given by a collection of subtrees of a tree and the subtrees are given by their leaves. This generalizes results of Olariu, Schwing, and Zhang [12] concerning the parallel complexity of problems on interval graphs provided the interval structure is given."
Author : Alan George
Publisher : Springer Science & Business Media
Page : 254 pages
File Size : 34,97 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461383692
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. The articles are grouped into three general categories: graph models of symmetric matrices and factorizations, graph models of algorithms on nonsymmetric matrices, and parallel sparse matrix algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysts and theoretical computer scientists alike.
Author : P. N. Klein
Publisher :
Page : 159 pages
File Size : 28,94 MB
Release : 1988
Category : Algorithms
ISBN :