CiteSeer.IST Home   Check: The following citations are predicted to all refer to the same paper.   Details

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. American Math. Society 2 (1956) 48--50.

J. B. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem". Proc. Amer. Math. Soc. 7 (1956), pp. 48--50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, pp. 48--50, 1956.

Joseph B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1):48--50, February 1956.

J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7 (1956), pp. 48--50.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 1956.

J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7:48--50, 1956.

J. Kruskal Jr., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7 (1956), pp. 48--50.

J. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem", Proc. Amer. Math. Soc., vol. 7, pp. 48--50, 1956.

J. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, pp. 48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7:48--50, 1956.

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7, (1956), 48--50.

J. Kruskal, "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem", Proceedings of American Mathematics Society, vol.7, pp. 48-50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Math. Society, 2, pp.48--50, 1956.

J. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, pp. 48--50, 1956.

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. American Math. Society, 2 (1956), pp. 48--50.

J. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, pp. 48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J.B. Jr. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the AMS, 7:48--50, 1956.

J.B. Kruskal. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. In Proc. Amer. Math. Soc., volume 15, pages 4850, 1956.

Kruskal, J.B.jr. (1956): On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7, 48 - 50.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math Soc. 7, 1956, pp. 48-50.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math Soc. 7, 1956, pp. 48-50.

J. Kruskal. "On the Shortest Spanning Subtree of a Graph and the Traveling ³³ Salesman Problem", Proc. Amer. Math. Soc., vol. 7, pp. 48-50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. AMS, 7:1, pages 48--50

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. AMS, 7:1, pages 48--50, 1956.

J.B. Kruskal, "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem," Proc. American Math. Soc., vol. 7, 48-50, 1956.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the AMS, Vol. 7, No. 1, pp. 48-50 (1956).

J. B. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem." Proceedings of the American Mathematical Society 7 (1956): 48--50.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem, " Proc. Amer. Math Soc. 7, 1956, pp. 48-50. 10

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1):48--50, 1956.

Joseph B. Kruskal, `On the shortest spanning subtree of a graph and the traveling salesman problem', Proceedings of the American Mathematical Society, 7, 48--50 (1956).

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. American Mathematical Society, Vol. 7, No. 1 (1956), pp. 48-50.

J. B. Kruskal Jr. - On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Amer. Math. Soc., ( 7): 48-50 (1956).

J. B. Kruskal. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem", Proc. American Mathematical Society, 7(1), pp. 48-50, 1956.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem", Proc. American Mathematical Society, 7(1), pp. 48-50, 1956.

Kruskal Jr.,J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. Amer. Math. Soc. ( 7) (1956) 48-50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. Amer. Math. Soc. 7 (1956), pp. 48--50.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem ", Proc. American Mathematical Society, 7(1), pp. 48-50, 1956.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, volume 7, pages 48--50, 1956.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. of the American Mathematical Society, 1956.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. of the American Mathematical Society, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, 7(1):48-- 50, 1956.

J.B.Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956), 48-50.

Kruskal, J.B.(1956) On the Shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 7, 48 -- 50.

Kruskal, J. B., "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem," Proc. Amer. Math. Soc., vol. 7, no. 1, 1956, pp. 4850.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. AMS, 7:1, pages 48--50, 1956.

J. B. Kruskal Jr., "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the American Mathematical Society, pp. 48-50, 1956.

J. Kruskal. "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, pp. 48--50, 1956.

, J.B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem ", Proc. American Mathematical Society, 7:4850, 1956.

Kruskal, J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7 (1956), 48--50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7 (1956), 48-50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7 (1956), 48-50.

Kruskal, J.B.(1956) On the Shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 7, 48 -- 50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc., 7:48-50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

Kruskal, J. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7: 48--50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48--56, 1956.

J.B. Kruskal, "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem," Proc. American Math. Soc., vol. 7, 48-50, 1956.

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7, pp. 48--50, (1956).

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, vol. 7: 48-50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48--50, 1956.

J.B. Kruskal. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. American Mathematical Society 7(1):48--50. American Mathematical Society, Providence, RI, USA 1956

Kruskal, J. B., On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7 (1956) 48 - 50.

J. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," in Proceedings of the American Mathematical Society, 1956.

Kruskal, J. B., "On the Shortest Spanning SubTree of a Graph and the Traveling Salesman Problem," Proceedings of the American Mathematical Society, 7 (1956), 48-50.

J.B. Kruskal, \On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem", Proc. AMS 7 (1956) 48-50.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Am. Math. Soc., vol. 7, pp. 48-50, 1956.

C. P. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, vol. 7, pages 48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. Amer. Math. Soc. 7 (1956), pp. 48--50. 13

Kruskal, J. B., "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem", Proc. Amer. Math. Soc., vol. 7, no. 1, 1956, pp. 48-50.

J.B. Kruskal, Jr, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 7 (1956) 48--50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the American Mathematics Society, vol. 7, no. 1, pp. 48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, vol. 7(1), pp. 48-- 50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, 7(1):48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, 7(1):48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, 7(1):48--50, 1956.

J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956), 48--50.

J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956), 48--50.

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48{ 50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, volume 7, pages 48-50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, volume 7, pages 48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7 (1956), 48-50.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7 (1956), 48--50.

J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 7 (48) (1956) 50.

J. B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7(1956):48-50, 1956.

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society, 7:48--50, 1956.

J. B. Kruskal. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society, 7(1):48--50, 1956. (p 108)

J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. American Math. Society, 7:48-50, 1956.

J.B. Kruskal Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. American Math. Soc., volume 7, pages 48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, 7 (1965), 48-50.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956. 21

J.B. Kruskal Jr., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956) 48-50.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.

J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, 7 (1956), pp. 48--50.

J. B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48-50, 1956.

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J. B. Kruskal, "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem," Proceedings of the American Mathematical Society, vol. 7, pp. 48--50, 1956.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society, 7:48--50, 1956.

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.

J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society,volume7, pages 48--50, 1956. L8. T. K. Landauer, P. W. Foltz, and D. Laham. Introduction to latent semantic analysis. Discourse Processes, 25:259--284, 1998.

CiteSeer.IST - Copyright Penn State and NEC