Minimal parametric networks in hyperspaces are nontrivial only within finiteness classes, with interior vertices as Fermat-Steiner solutions on adjacent vertices, and generalized conditions for realizing one-sided Hausdorff distances with convex boundary sets.
Intelligent systems, Theory and applications, vol 25, no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.MG 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Minimal Parametric Networks in Hyperspaces and their Properties
Minimal parametric networks in hyperspaces are nontrivial only within finiteness classes, with interior vertices as Fermat-Steiner solutions on adjacent vertices, and generalized conditions for realizing one-sided Hausdorff distances with convex boundary sets.