On Simple Characterizations of k-trees.
HARVARD UNIV CAMBRIDGE MASS CENTER FOR RESEARCH IN COMPUTING TECHNOLOGY
Pagination or Media Count:
K-trees are a special class of perfect elimination graphs which arise in the study of sparse linear systems. The author presents four simple characterizations of k-trees involving cliques, paths, and separators. Author
- Theoretical Mathematics