Fast parallel algorithms for chordal graphs

Authors:
J. Naor;M. Naor;A. Schaffer
Affiliations:
Computer Science Division, University of California at Berkeley, Berkeley, California;-;Computer Science Department, Stanford University, Stanford, California
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 12
Cited 3

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
A taxonomy of problems with fast parallel algorithms

Information and Control
The NP-completeness column: An ongoing guide

Journal of Algorithms
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Computing connected components on parallel computers

Communications of the ACM
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
The Matching Problem for Strongly Chordal Graphs is in $NC$

The Matching Problem for Strongly Chordal Graphs is in $NC$
Combinatorial problems in matrix computation

Combinatorial problems in matrix computation
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

NC Algorithms for Recognizing Chordal Graphs and k Trees

IEEE Transactions on Computers
Register allocation in structured programs

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast parallel algorithms for the clique separator decomposition

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an NC algorithm for recognizing chordal graphs, and we present NC algorithms for finding the following objects on chordal graphs: all maximal cliques, an intersection graph representation, an optimal coloring, a perfect elimination scheme, a maximum independent set, a minimum clique cover, and the chromatic polynomial. The well known polynomial algorithms for these problems seem highly sequential, and therefore a different approach is needed to find parallel algorithms.