article Open AccessTop 10% cited
On the shortest spanning subtree of a graph and the traveling salesman problem
Proceedings of the American Mathematical Society · 1956 · Vol. 7(1) · pp. 48–50
Abstract
7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J. Levitzki, On the radical of a general ring, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 462^66. 9. -, On three problems concerning nil rings, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 913-919. 10. -, On the structure of algebraic algebras and related rings, Trans. Amer. Math. Soc. vol. 74 (1953) pp. 384-409.
Advanced Graph Theory ResearchGraph theory and applicationsMathematicsCombinatoricsRing (chemistry)GraphAlgebraic numberTravelling salesman problemDiscrete mathematicsMathematical optimizationChemistryMathematical analysis
Citations
5,025
FWCI
4.46
field-weighted impact
References
0
Percentile
94%
vs. same field & year
Citations per year
Cited by
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers · 1971 · 1,744 citations
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys · 1991 · 4,264 citations
Trade Integration, Market Size, and Industrialization: Evidence from China's National Trunk Highway System
The Review of Economic Studies · 2014 · 975 citations
Approximating discrete probability distributions with dependence trees
IEEE Transactions on Information Theory · 1968 · 2,618 citations
A Review of Methodological Approaches for the Design and Optimization of Wind Farms
Energies · 2014 · 307 citations
EXPERT SYSTEMS WITH APPLICATIONS
Expert Systems with Applications · 2004 · 1,660 citations
The TimberWolf placement and routing package
IEEE Journal of Solid-State Circuits · 1985 · 529 citations
Topology representing networks
Neural Networks · 1994 · 889 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
