Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon

Mathematics of Computation - United States
doi 10.1090/s0025-5718-1969-0249323-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Steiner Minimal Trees on Sets of Four Points

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1987English

On the Distribution of the Number of Vertices of a Random Polygon

Sitzungsberichte und Anzeiger
2005English

The Minimal Trees of Steiner Wiener Index With Given Matching Number

Pure Mathematics
2017English

Convex Hulls of Uniform Samples From a Convex Polygon

Advances in Applied Probability
Applied MathematicsStatisticsProbability
2012English

The Maximal \Alpha-Index of Trees With K Pendent Vertices and Its Computation

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2020English

Minimal Nontoroidal Graphs on Eight Vertices

Advances in Applied Mathematics
2013English

Steiner Minimal Tree for Points on a Circle

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Minimal-Length Linearizations for Mildly Context-Sensitive Dependency Trees

2009English

On the Expected Number of Shadow Vertices of the Convex Hull of Random Points

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy