By Topic

A graph optimization-synthesis formulation for cable-communications systems

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)

The cable-communications systems, m -center, and minimum spanning-tree problems are contained within a general graph optimization-synthesis problem. In the minimum spanningtree problem, a decomposition technique is used in constructing minimal-length trees. This problem is related to the m -center problem where the total number of vertices is estimated from the length of the spanning tree. Both results, vertex estimate and decomposition, are utilized in the cable-communications systems problem. A procedure and example are provided for estimating the dollar cost of a cable-communications system.

Published in:

IEEE Transactions on Circuit Theory  (Volume:20 ,  Issue: 3 )