Tree generation
No Thumbnail Available
Authors
Meeting name
Sponsors
Date
Journal Title
Format
Book
Subject
Abstract
An efficient method of generating all trees of a connected graph by using the concept of a cutset is presented. Any connected graph can be divided into simpler separate subgraphs by a cutset operation whose forests can be easily found. The trees of the whole graph can then be generated with ease and efficiency.