Shortest connectivity. An introduction with applications in phylogeny.
From MaRDI portal
Publication:1762565
zbMath1086.92037MaRDI QIDQ1762565
Publication date: 10 February 2005
Published in: Combinatorial Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Research exposition (monographs, survey articles) pertaining to biology (92-02)
Related Items (7)
Tropical Fermat--Weber Points ⋮ The Fermat-Torricelli problem. I: A discrete gradient-method approach ⋮ Nonstandard \(n\)-distances based on certain geometric constructions ⋮ Topological optimization of the large-scale data transmission networks ⋮ Solving a generalized Gauss problem ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ An algebraic approach to finding the Fermat–Torricelli point
This page was built for publication: Shortest connectivity. An introduction with applications in phylogeny.
