A note on M-convexity in polyhedral split decomposition of distances
DOI10.1007/S13160-011-0052-YzbMATH Open1260.52008OpenAlexW2140175100MaRDI QIDQ691985FDOQ691985
Authors: Shungo Koichi
Publication date: 4 December 2012
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-011-0052-y
Recommendations
tree metric\(M\)-convex functioncross-free familypolyhedral split decompositionsplit-decomposability
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Discrete Convex Analysis
- A canonical decomposition theory for metrics on a finite set
- Submodular functions and optimization.
- Basic phylogenetic combinatorics.
- Analytic inversion of the five-point Poisson operator
- A geometric study of the split decomposition
- \(M\)-convex functions and tree metrics
- Extension of M-convexity and L-convexity to polyhedral convex functions
Cited In (3)
This page was built for publication: A note on \(M\)-convexity in polyhedral split decomposition of distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691985)