Subject
Signal Processing,Control and Systems Engineering,Software
Reference14 articles.
1. Smirnov, A.V., The shortest path problem for a multiple graph, Autom. Control Comput. Sci., 2018, vol. 52, no. 7, pp. 625–633. https://doi.org/10.3103/S0146411618070234
2. Smirnov, A.V., The spanning tree of a divisible multiple graph, Autom. Control Comput. Sci., 2018, vol. 52, no. 7, pp. 871–879. https://doi.org/10.3103/S0146411618070325
3. Kruskal, J.B., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc., 1956, vol. 7, no. 1, pp. 48–50. https://doi.org/10.1090/S0002-9939-1956-0078686-7
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, The MIT Press, 2009, 3rd ed.
5. Berge C., Graphs and Hypergraphs, North-Holland, 1973.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献