By Topic

On generation of trees without duplications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

It is shown that, in a given graph, the set of trees not containing a given branch can be obtained from the set of trees containing the given branch without duplications. Based on this, a simple derivation of Mayeda and Seshu's technique on generation of trees without duplications is given.

Published in:

Proceedings of the IEEE  (Volume:57 ,  Issue: 7 )