Shortest connection networks and some generalizations

Keywords

Connection (principal bundle), Simple (philosophy), Set (abstract data type), Class (philosophy), Computer science

References

• On the shortest spanning subtree of a graph and the traveling salesman problemJoseph B. Kruskal — 1956

Cited by

• Design and Implementation of an OSD System and Prefetching ModelsRiyaz Shiraguppi — 2008
• Assisting concept assignment using probabilistic classification and cognitive mappingBrendan Cleary, Chris Exton — 2006
• A population genetic analysis of chloroplast DNA in wild populations of Prunus avium L. in EuropeRebeca Pérez Arriaga — 2001
• Dynamic Degree Constrained Network Design: A Genetic Algorithm ApproachChao‐Hsien Chu, G. Premkumar, Carey Chou — 1999
• Geometrische Datenstrukturen in einer Nicht-Standard-DatenbankHeinrich Toben — 1991
• Potentiel évolutif et adaptation des populations de l'agent du mildiou de la laitue, Bremia lactucae, face aux pressions de sélection de la plante hôte, Lactuca sativaRomain Valade — 2012
• Problems in communication network design and location planning : new solution procedures /Rakesh Gupta — 1996
• The Filter-Kruskal Minimum Spanning Tree AlgorithmVitaly Osipov, Peter Sanders, Johannes Singler — 2009
• The systematic anatomy of Grevilleeae and Persooniinae (Proteaceae)Dorothy Catling — 1996
• An Architecture-Independent Unified Approach to FPGA RoutingMichael J. Alexander, Gabriel Robins — 1993
• Large-scale automated image analysis for computational profiling of brain tissue surrounding implanted neuroprosthetic devices using Pythonsem registro — 2014
• Optimization Models of Transportation Network ImprovementRoss D. MacKinnon, Gerald M. Barber — 1977
• Description combinatoire des ultramétriquesBruno Leclerc — 1981
• Continuous Graphical Models for Static and Dynamic Distributions: Application to Structural BiologyNarges Razavian — 2013
• A fast approximation for minimum spanning trees in k-dimensional spacePravin M. Vaidya — 1984
• Développement de la Super Station LOFAR & observations planétaires avec LOFARJ. N. Girard — 2013
• Accelerating Graph Analysis with Heterogeneous SystemsAte Penders — 2012
• Bandwidth on Demand for Laser Communications SatellitesAlexander Melin — 2008
• Developing Efficient Metaheuristics for Communication Network Problems by using Problem-specific KnowledgeFranz Rothlauf, Armin Heinzl — 2004
• An empirical examination of exact algorithms for the Cardinality Steiner ProblemWilliam Brent Johnston — 1988

Related papers

• On the Finsler Connection Associated with a Linear Connection Satisfying P^h_ =0Yoshihiro Ichijyô — 1978
• The conjugate connection of a Yang-Mills connectionJoon Sik Park — 2008
• The [0-Simple] Simple Subsemigroups of Nonnegative MatricesQian Shuang-ping — 2000
• On Generalized h-Recurrent Finsler ConnectionKhageshwar Mandal — 2021
• Fundamental relations in simple and 0-simple semihypergroups of small sizeDario Fasino, Domenico Freni — 2012
• Book Review: IV. Pastorial — Practical Studies: Simple Sermons for Times like These, Simple Sermons on Evangelistic Themes, Simple Talks for Christian Workers, Simple Sermons on Prophetic Themes, Simple Sermons about Jesus Christ, Simple Sermons on Heaven, Hell, and Judgment, Simple Sermons on the Ten Commandments, Simple Sermons for a Sinful Age, Simple Sermons on the Seven Churches of RevelationJames W. Cox — 1975
• Relationship between Several Important Classes of SetChen Shun-qing — 2002