By Topic

Comments on "Computer Generation of Trees and Co-Trees in a Cascade of Multiterminal Networks

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
$31 $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

3 Author(s)

The problem of efficient generation of all trees has been considered in the above paper' by Chen [1]. The method is to decompose the original graph into several components and determining appropriate subgraphs in each component and then combining these subgraphs to obtain the desired results. We show that this method has an undesirable feature, which is the duplicate generation of some trees. Therefore, Theorem 4 of the paper [1] must be corrected. The definitions of all symbols will not be redefined here; we refer to Chen's original paper for detailed treatment.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:28 ,  Issue: 7 )