Tree generation

Access Full Text

Tree generation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

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.

Inspec keywords: networks (circuits); artificial intelligence, automata theory and switching theory; circuit theory; mathematics; diagrams

Subjects: Circuit theory; Computer theory

http://iet.metastore.ingenta.com/content/journals/10.1049/el_19660268
Loading

Related content

content/journals/10.1049/el_19660268
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading