Modeling of optimal networks by means of linkages
DOI10.1007/S10958-021-05651-5zbMATH Open1479.05336OpenAlexW3212520846MaRDI QIDQ2055321FDOQ2055321
Authors: M. Yu. Zhitnaya
Publication date: 1 December 2021
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-021-05651-5
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Branching extremals of the functional of $ \lambda$-normed length
- Title not available (Why is that?)
- Locally minimal trees in \(n\)-normed spaces
- Title not available (Why is that?)
- On the Problem of Steiner
- A linear time algorithm for full Steiner trees
- Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$
Cited In (7)
- Models for Branching Networks in Two Dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotically Optimal Interconnection Networks from Two-State Cells
- Convergent network approximation for the continuous Euclidean length constrained minimum cost path problem
This page was built for publication: Modeling of optimal networks by means of linkages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055321)