Fast parallel algorithms for the clique separator decomposition

Authors:
Elias Dahlhaus;Marek Karpinski;Mark B. Novick
Affiliations:
Department of Computer Science, University of Bonn;Department of Computer Science, University of Bonn and International Computer Science Institute, Berkeley, California;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 9
Cited 0

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
Fast parallel algorithms for chordal graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Binary tree algebraic computation and parallel algorithms for simple graphs

Journal of Algorithms
Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs

Information Processing Letters
Parallel sparse Cholesky factorization

Parallel sparse Cholesky factorization
Fast Parallel Decomposition by Clique Separators

Fast Parallel Decomposition by Clique Separators
Efficient Parallel Algorithm for Clique Separator Decomposition

Efficient Parallel Algorithm for Clique Separator Decomposition
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph

Quantified Score

Hi-index	0.00

Visualization

Abstract