This is a preview of subscription content, log in via an institution to check access.
Literature Cited
F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts (1969).
A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Novosibirsk (1969).
M. Held and R. M. Karp, “Application of dynamic programming to sorting problems,” in: Collected Papers in Cybernetics [Russian translation], No. 9, Mir, Moscow (1964).
R. K. Prim, “Shortest connecting net and some generalizations,” in: Collected Papers in Cybemetics [Russian translation], No. 2, IL, Moscow (1961).
J. Kruskal, “On the shortest spanning subtree of a graph and the traveling salesman problem,” Proc. Am. Math. Soc., 7 (1956).
G. J. Minty, “An n2 algorithm for determining all the trees of a graph,” Information Processes Letters, 1, No. 2 (1971).
R. E. Tarjan, An Efficient Planarity Algorithm, Stanford University, November (1971).
V. Strassen, “The Gauss algorithm is not optimal,” in: Collected Papers in Cybernetics [Russian translation], No. 7, Mir, Moscow (1970).
Additional information
Translated from Kibernetika, No. 6, pp. 109–115, November–December, 1974
Rights and permissions
About this article
Cite this article
Kozina, A.V., Kozyrev, V.P. Enumeration of shortest connecting nets with additional constraints. Cybern Syst Anal 10, 1035–1042 (1974). https://doi.org/10.1007/BF01069450
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069450