Description: Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations.
Date: November 1, 1992
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))
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department