An introduction to chordal graphs and clique trees
An introduction to chordal graphs and clique trees
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.
- Oak Ridge National Laboratory United States
- University of North Texas United States
- University of Tennessee at Knoxville United States
Mathematics And Computers, Matrices, Diagrams 990200, 000, And Information Science, Computing, Mathematical Logic 990200* -- Mathematics & Computers, 99 General And Miscellaneous//Mathematics, Algorithms, 004, Diagrams
Mathematics And Computers, Matrices, Diagrams 990200, 000, And Information Science, Computing, Mathematical Logic 990200* -- Mathematics & Computers, 99 General And Miscellaneous//Mathematics, Algorithms, 004, Diagrams
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!