On Simple Characterizations of k-trees.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 17, 1973
Accession Number
AD0766484

Entities

People

  • Donald J. Rose

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Elimination
  • Linear Systems

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Phased Array Antenna Design.
  • Statistical inference.