NC Algorithms for Recognizing Chordal Graphs and k Trees

Authors:
N. Chandrasekharan;S. S. Iyengar
Affiliations:
Clemson Univ., Clemson, SC;Louisiana State Univ., Baton Rouge
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 6
Cited 3

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

SIAM Journal on Computing
Fast parallel algorithms for chordal graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
Properties of acyclic database schemes

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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)

Parallel recognition algorithms for chordal_planar graphs and planar k-trees

Journal of Parallel and Distributed Computing
On the complexity of some subgraph problems

Discrete Applied Mathematics
The space complexity of k-tree isomorphism

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Quantified Score

Hi-index	14.99

Visualization

Abstract

The authors present parallel algorithms for recognizing the chordal graphs and k trees. Under the PRAM (parallel random-access-machine) model of computation with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n/sup 4/) processors. The algorithms have a better processor bound than an independent result by A. Edenbrandt (1985) for recognizing chordal graphs in parallel using O(n/sup 3/m) processors.