Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Traveling Salesman Problem
Related Publications
(30)
Shortest connection networks and some generalizations
Introduction to Algorithms, Second Edition
Modern Information Retrieval
A randomized lineartime algorithm to find minimum spanning trees
A powerful global router: based on Steiner minmax trees
Subscribe
Academic
Publications
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,10.2307/2033241,Proceedings of The American Mathematical Society,Joseph
Edit
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
(
Citations: 1010
)
BibTex

RIS

RefWorks
Download
Joseph B. Kruskal
Journal:
Proceedings of The American Mathematical Society  PROC AMER MATH SOC
, vol. 7, no. 1, pp. 4848, 1956
DOI:
10.2307/2033241
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.ams.org
)
(
www.jstor.org
)
Citation Context
(461)
...Based on the above discussion, MST� can be found by extending the Kruskal’s MST algorithm [
16
] as follows: First, for each source si, find the closest point on � , ri. Then, sort all the edges of the form ðsi ;s jÞ and ðsi ;r jÞ in the increasing order of their lengths...
Guoliang Xing
,
et al.
Efficient Rendezvous Algorithms for MobilityEnabled Wireless Sensor N...
...It is well known that � is associated to the simplest method for hierarchical classification called single linkage clustering [7, 36], closely related to Kruskal’s algorithm [
37
] for computing a minimum spanning tree...
Laurent Najman
.
On the Equivalence Between Hierarchical Segmentations and Ultrametric ...
...Using this Delta efficiency metric and Kruskal’s algorithm (
Kruskal 1956
) for minimum spanning tree generation, we are able to infer the influence hierarchy in the network...
...From this weighted graph, we use Kruskal’s Minimum Spanning Tree algorithm (
Kruskal 1956
) to generate a tree...
Frédéric Gilbert
,
et al.
Communities and hierarchical structures in dynamic social networks: an...
...There are now two algorithms commonly used, Kruskal’s algorithm developed in Kruskal (1956) [
18
] and Prim’s algorithm developed in Prim (1957) [20]...
...Probably, the most famous algorithms for computing the mt associated with an mcstp are the ones introduced in Boruvka (1926) [12], Kruskal (1956) [
18
], and Prim...
Gustavo Bergantiños
,
et al.
The folk solution and Boruvka’s algorithm in minimum cost spanning tre...
...The minimum spanning tree (MST) (Kruskal
1956
), the Delaunay triangulation (DT) (Delaunay
1934
), the relative neighbourhood graph (RNG) (Toussaint
1980
) and the Gabriel graph (GG) Gabriel and Sokal
(1969)
are prominent representatives of proximity graphs...
Zhenyu Liu
,
et al.
Lens data depth and median
Sort by:
Citations
(1010)
Efficient Rendezvous Algorithms for MobilityEnabled Wireless Sensor Networks
Guoliang Xing
,
Minming Li
,
Tian Wang
,
Weijia Jia
,
Jun Huang
Journal:
IEEE Transactions on Mobile Computing  TMC
, vol. 11, no. 1, pp. 4760, 2012
On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds
(
Citations: 3
)
Laurent Najman
Journal:
Journal of Mathematical Imaging and Vision  JMIV
, vol. 40, no. 3, pp. 231247, 2011
Communities and hierarchical structures in dynamic social networks: analysis and visualization
(
Citations: 3
)
Frédéric Gilbert
,
Paolo Simonetto
,
Faraz Zaidi
,
Fabien Jourdan
,
Romain Bourqui
Published in 2011.
The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems
(
Citations: 1
)
Gustavo Bergantiños
,
Juan VidalPuga
Journal:
Discrete Applied Mathematics  DAM
, vol. 159, no. 12, pp. 12791283, 2011
Lens data depth and median
(
Citations: 1
)
Zhenyu Liu
,
Reza Modarres
Journal:
Journal of Nonparametric Statistics  J NONPARAMETR STAT
, vol. aheadofp, no. aheadofp, pp. 112, 2011