On the Decomposition of Networks in Minimally Interconnected Subnetworks

1 May 1969

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory

Vol. 16 (2) , 184-188
https://doi.org/10.1109/tct.1969.1082924

Abstract

The problem of decomposing a network into different groups of electrical components, which are interconnected by the minimum number of leads, is discussed. For this purpose, minimal groups of components are defined as the ones fulfilling a chosen minimality criterion, and a number of their properties are illustrated. Some of these properties are directly employed in a procedure for the determination of all the minimal groups for a given network.

Keywords

INTEGRATED CIRCUIT INTERCONNECTIONS
COMPUTER NETWORKS
CIRCUIT THEORY
TREE GRAPHS
JOINING PROCESSES
MERGING

This publication has 2 references indexed in Scilit:

ACCEL: Automated circuit card etching layout
Proceedings of the IEEE, 1967
An Algorithm for Path Connections and Its Applications
IEEE Transactions on Electronic Computers, 1961