Abstract
The motivation for the work presented in this paper stems from two major sources:
-
1.
The desire to reduce the manufacturing of the computer to mass production techniques.
-
2.
The desire to miniaturize the size of the computer so that lead lengths between the logic elements do not become the major delays in the system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Berge, “Theorie des Graphes et Ses Applications,” ( Dunod, Paris, 1958 ) pp. 31–32.
R. J. Preiss, “Design Automation Survey,’ IBM Technical Note, TN 00.480 (1960) pp. 3–4.
U. R. Kodres, ‘Geometrical Positioning of Circuit Elements in a Computer, AIEE CP 59–1172 (Oct., 1959 ).
J. B. Kruskal, Jr., On The Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Am. Math. Soc., Vol. 7 (1956) pp. 48–50.
R. E. Gomory, “An Algorithm for Integer Solutions to Linear Programs,’ Princeton—IBM Mathematics Research Project Technical Report, No. 1 (Nov. 17, 1958 ).
A. H. Wallace, Introduction to Algebraic Topology, ( Pergamon Press, New York, 1957 ) pp. 100–102.
R. Courant and H. Robbins, “What Is Mathematics?” (Oxford University Press, New York, 1941) pp.267–269.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1962 Springer Science+Business Media New York
About this paper
Cite this paper
Kodres, U.R. (1962). Formulation and Solution of Circuit Card Design Problems through Use of Graph Methods. In: Walker, G.A. (eds) Advances in Electronic Circuit Packaging. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7311-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7311-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7297-2
Online ISBN: 978-1-4899-7311-5
eBook Packages: Springer Book Archive