Fast parallel algorithms for the clique separator decomposition
Author : Elias Dahlhaus
Publisher :
Page : 30 pages
File Size : 28,94 MB
Release : 1989
Category :
ISBN :
Author : Elias Dahlhaus
Publisher :
Page : 30 pages
File Size : 28,94 MB
Release : 1989
Category :
ISBN :
Author : International Computer Science Institute
Publisher :
Page : pages
File Size : 46,28 MB
Release : 1989
Category :
ISBN :
Author : Cornell University. Dept. of Computer Science
Publisher :
Page : 9 pages
File Size : 49,12 MB
Release : 1989
Category : Algorithms
ISBN :
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a series of cliques whose removal disconnects the graph. This algorithm allows one to extend a large body of results which were originally formulated for chordal graphs to other classes of graphs. Our algorithm is a parallel version of Tarjan's sequential algorithm for solving this problem. The decomposition can also be used to find NC algorithms for some optimization problems on special families of graphs, assuming these problems can be solved in NC for the prime graphs of the decomposition. These optimization problems include: finding a maximum-weight clique, a minimum coloring, a maximum-weight independent set, and a minimum fill-in elimination ordering. We also give the first parallel algorithms for solving these problems by using the clique separator decomposition. Our maximum-weight independent set alforithm applied to chordal graphs yields the most efficient known parallel algorithm for finding a maximum-weight independent set of a chordal graph.
Author :
Publisher : Society for Industrial and Applied Mathematics (SIAM)
Page : 546 pages
File Size : 26,31 MB
Release : 1990
Category : Computers
ISBN :
Symposium held Jan. 22-24, 1990, San Francisco, Calif.
Author : Elias Dahlhaus
Publisher :
Page : 18 pages
File Size : 34,67 MB
Release : 1988
Category :
ISBN :
Author : Rolf Karlsson
Publisher : Springer Science & Business Media
Page : 274 pages
File Size : 25,75 MB
Release : 1988-06-22
Category : Computers
ISBN : 9783540194873
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.
Author : Cornell University. Dept. of Computer Science
Publisher :
Page : 15 pages
File Size : 38,91 MB
Release : 1989
Category : Algorithms
ISBN :
These computations are the bottlenecks to an efficient parallel algorithm since they are only parts of the algorithm where [omega](n2) processors are required. However, they can be performed in O(n2) time sequentially."
Author : Elias Dahlhaus
Publisher :
Page : 14 pages
File Size : 44,15 MB
Release : 1987
Category :
ISBN :
Author : Gary J. Harkin
Publisher :
Page : 282 pages
File Size : 43,47 MB
Release : 1988
Category : Algorithms
ISBN :
Author : Symposium on Foundations of Computer Science
Publisher :
Page : 664 pages
File Size : 28,9 MB
Release : 1989
Category :
ISBN : 9780818619823
The symposium was held Oct.-Nov. 1989, Research Triangle Park, North Carolina. One hundred papers in theoretical computer science treat dispersers, deterministic amplification, and weak random sources; efficient NC algorithms for set cover with applications to learning and geometry; the inverse of automorphism in polynomial time; and speeding-up linear programming using fast matrix multiplication. Acidic paper; no subject index. Annotation copyrighted by Book News, Inc., Portland, OR.