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. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On the Spanning Trees of Weighted Graphs - Mayr, Plaxton (1992) (5 citations) (Correct)
....problem in computer science for which a large number of sequential, parallel and distributed algorithms have been devised. To the graph theorist, however, this body of work has provided little beyond the underlying proof of correctness of the original greedy algorithms due to Kruskal and Prim [Kr][Pr] Evidently, the advances have occurred in the areas of data structures, parallel processing techniques and distributed protocols. In contrast, this paper attacks questions arising from a generalization of the minimum spanning tree concept that requires additional insight at the ....
....sequence of edge swaps required to transform P into Q is precisely d(P; Q) We will have occasion to make use of several well known facts about 1 MSTs. The validity of each of these statements follows easily from the proof of correctness of Kruskal s greedy algorithm for computing a 1 MST [Kr]. In Kruskal s algorithm, the edges are first sorted in ascending order by weight (within a set of edges of equal weight, the order is arbitrary) The algorithm then runs through the sorted sequence of edges, adding each edge to a set T (initially empty) if and only if the resulting set of edges ....
J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7 (1956), 48-50.
Improving Offset Assignment through Variable Coalescing - Ottoni, Ottoni, Araujo.. (2003) (Correct)
....more than one variable per slot. that, a large number of heuristic techniques have been proposed for SOA [16, 13, 4, 11, 19] making it one of the most studied problems in code generation for DSPs. Liao et al. [16] used a heuristic to solve SOA based on the Kruskal Minimum Spanning Tree algorithm [8]. Given a basic block, Liao et al. [16] call access sequence the sequence used by the program to access variables during execution time. For example, in instruction a = b op c, the access sequence is bca. Based on the access sequence, Liao et al. de ne an weighted graph G(V; E) called access ....
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.
Learning from Labeled and Unlabeled Data with Label Propagation - Zhu, Ghahramani (2002) (3 citations) (Correct)
.... T ul YL (4) is a fixed point. Therefore it is the unique fixed point and the solution to our iterative algorithm. 2.3 Parameter setting We set the parameter with a heuristic. We find a minimum spanning tree (MST) over all data points under Euclidean distances d ij , with Kruskal s Algorithm [3]. In the beginning no node is connected. During tree growth, the edges are examined one by one from short to long. An edge is added to the tree if it connects two separate components. The process repeats until the whole graph is connected. We find the first tree edge that connects two components ....
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.
Learning from Labeled and Unlabeled Data with Label Propagation - Zhu, Ghahramani (2002) (3 citations) (Correct)
....a sparse system of linear equations (i.e. if we truncate small elements on T uu ) which can be ecient. 2.4 Parameter Setting We set the parameter with the following heuristic. We nd a minimum spanning tree over all data points with Euclidean distances d ij , with Kruskal s Algorithm [Kru56] In the beginning no node is connected. During tree growth, the edges are examined one by one from short to long. An edge is added to the tree if it connects two separate components. The process repeats until the whole graph is connected. We nd the rst tree edge that connects two components ....
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.
Minimum Spanning Trees Displaying Semantic Similarity - Wlodzislaw Duch And (Correct)
No context found.
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.
Parallel Algorithms for Hierarchical Clustering - Clark Olson Computer (1993) (36 citations) (Correct)
No context found.
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.
Multicast Routing Under Optical Layer Constraints - Xin, Rouskas (2004) (Correct)
No context found.
J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society, 7:48--50, 1956.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
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.
Memetic Algorithms for Combinatorial Optimization Problems.. - Merz (2001) (8 citations) (Correct)
No context found.
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.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
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.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
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.
Optimally Cutting a Surface into a Disk - Erickson, Har-Peled (2002) (7 citations) (Correct)
No context found.
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.
A General Approximation Technique For Constrained Forest.. - Goemans, Williamson (1995) (139 citations) (Correct)
No context found.
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.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
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.
Revisiting Esau-Williams' Algorithm: On the Design of Local.. - Raja Jothi And (2004) (Correct)
No context found.
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.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
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
An Approximation Algorithm for the Multicast Congestion.. - Jansen, Zhang (2002) (3 citations) (Correct)
No context found.
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.
A Practical Minimum Spanning Tree Algorithm Using the.. - Katriel, Sanders, Träff (2003) (Correct)
No context found.
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.
Approximation Algorithms for the Single-Sink Edge Installation.. - Jothi (2004) (Correct)
No context found.
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.
A Comparison of Network Coding and Tree Packing - Yunnan Wu Philip (2004) (1 citation) (Correct)
No context found.
J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. American Math. Society, 7:48-50, 1956.
Reconfigurable wavelength-switched optical networks for the.. - Granger (2003) (2 citations) (Correct)
No context found.
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)
Multicast Routing under Optical Layer Constraints - Xin, Rouskas (2004) (Correct)
No context found.
J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society, 7:48--50, 1956.
Approximate Distance Oracles Revisited - Gudmundsson, Levcopoulos.. (2002) (2 citations) (Correct)
No context found.
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.
A Survey of Combinatorial Optimization Problems in Multicast .. - Oliveira, Pardalos (2003) (Correct)
No context found.
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.
Reconstructing a Minimum Spanning Tree after Deletion of Any Node - Das, Loui (2001) (Correct)
No context found.
J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7 (1956), 48--50.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC