On finding minimum-diameter clique trees

Authors:
Jean R. S. Blair;Barry W. Peyton
Affiliations:
Department of Electrical Engineering and Computer Science, United States Military Academy, West Point, NY;Mathematical Sciences Section, Oak Ridge National Laboratory, P.O. Box 2008, Bldg. 6012 Oak Ridge, TN
Venue:
Nordic Journal of Computing
Year:
1994

Citing 12
Cited 2

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

SIAM Journal on Computing
Generating the maximum spanning trees of a weighted graph

Journal of Algorithms
A linear reordering algorithm for parallel pivoting of chordal graphs

SIAM Journal on Discrete Mathematics
Counting clique trees and computing perfect elimination schemes in parallel

Information Processing Letters
A fast algorithm for reordering sparse matrices for parallel factorization

SIAM Journal on Scientific and Statistical Computing
The multifrontal method for sparse matrix solution: theory and practice

SIAM Review
Highly parallel sparse Cholesky factorization

SIAM Journal on Scientific and Statistical Computing
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)
The Multifrontal Solution of Indefinite Sparse Symmetric Linear

ACM Transactions on Mathematical Software (TOMS)
Independent Computations in a Probabilistic Knowledge-Based System

Independent Computations in a Probabilistic Knowledge-Based System
Clique graph models for independent computations

Clique graph models for independent computations

Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization

The Journal of Supercomputing
Moplex orderings generated by the LexDFS algorithm

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

A clique-tree representation of a chordal graph often reduces the size of the data structure needed to store the graph, permitting the use of extremely efficient algorithms that take advantage of the compactness of the representation. Since some chordal graphs have many distinct clique-tree representations, it is interesting to consider which one is most desirable under various circumstances. A clique tree of minimum diameter (or height) is sometimes a natural candidate when choosing clique trees to be processed in a parallel-computing environment. This paper introduces a linear-time algorithm for computing a minimum-diameter clique tree.