Abstract
The paper contains proposals for a uniform way to formulate and solve the design tasks in which the designed object is a system consisting of a certain number of interconnected elements in a defined way. Two types of tasks are formulated: The designing of optimal interelemental connection nets and optimal layout of system’s component elements in a given space. It was shown that both these tasks are brought to the transformation of graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
K. Leinemann, “Ein Ansatz zur formallen Objektbeschreibung fuer das rechnergestuetzte Entwickeln und Konstruieren” Angewandte Informatik 9, 403–406 (1974).
N. Christofides, Graph Theory, An Algorithmic Approach (Academic Press, New York, 1975).
C. Berge, Graphs and Hypergraphs (North-Holland American Elsevier, 1973).
J. B. Kruskal Jr, “On the shortest spanning subtree of a graph and the traveling salesman problem” Proc. Amer. Math. Soc. No. 7, 48.
T. Jeleniewski, “O pewnym zadaniu z teorii grafów i jego zastosowaniach do projektowania urządzeń cyfrowych” Prac. Nauk. Instytutu Cybernetyki Techn. Politechniki Wroclawskiej, Studia i Materialy, No. 11, 3–31 (1974).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 The World Organisation of General Systems and Cybernetics
About this chapter
Cite this chapter
Jeleniewski, T. (1978). Some Theoretical Problems of the Layout and Connection Tasks in the Design of Technical Systems. In: Rose, J. (eds) Current Topics in Cybernetics and Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-93104-8_206
Download citation
DOI: https://doi.org/10.1007/978-3-642-93104-8_206
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-93106-2
Online ISBN: 978-3-642-93104-8
eBook Packages: Springer Book Archive