On finding minimum-diameter clique trees
Description:
It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). 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-…
more
Date:
August 1, 1991
Creator:
Blair, J.R.S. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science) & Peyton, B.W. (Oak Ridge National Lab., TN (United States))
Partner:
UNT Libraries Government Documents Department