A geometric atudy of the split decomposition

Discrete and Computational Geometry

Volumn 36, Issue 2, 2006, Pages 331-361

  Hirai, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746917973     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1243-1     Document Type: Article

References (27)

1. H.-J. Bandelt and A. W. M. Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math. 92 (1992), 47-105.
2. J.-P. Barthélémy and A. Guénoche, Trees and Proximity Representations (translated from the French by G. Lawden), Wiley, Chichester, 1991.
3. L. Billera, P. Filliman, and B. Sturmfels, Constructions and complexity of secondary polytopes, Adv. Math. 83 (1990), 155-179.
4. E. D. Bolker, A class of convex bodies, Trans. Amer. Math. Soc. 145 (1969), 323-345
5. P. Buneman, The recovery of trees from measures of dissimilarity, in Mathematics in the Archaeological and Historical Sciences (F. R. Hodson, D. G. Kendall, and P. Tautu, eds.), Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
6. J. A. De Loera, B. Sturmfels, and R. R. Thomas, Gröbner bases and triangulations of the second hypersimplex, Combinatorica 15 (1995), 409-424.
7. A. W. M. Dress, Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: a note on combinatorial properties of metric spaces, Adv. Math. 53 (1984), 321-402.
8. A. W. M. Dress, Towards a classification of transitive group actions on finite metric spaces, Adv. Math. 74 (1989), 163-189.
9. A. Dress, V. Moulton, and W. Terhalle, T-theory: an overview, Eumpean J. Combin. 17 (1996), 161-175.
10. R. M. Erdahl and S. S. Ryshkov, On lattice dicing, European J. Combin. 15 (1994), 459-481
11. A. Frank, An algorithm for submodular functions on graphs, Ann. Discrete Math. 16 (1982), 97-120.
12. S. Fujishige, Theory of submodular programs: a Fenchel-type min-max theorem and subgradients of submodular functions, Math. Program. 29 (1984), 142-155.
13. S. Fujishige, Submodular Functions and Optimization, 2nd edn., Elsevier, Amsterdam, 2005.
14. I. M. Gel'fand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants, Birkhäuser, Boston, MA, 1994.
15. H. Hirai, Characterization of a distance between subtrees of a tree associated with tight span, Ann. Combin. 10 (2006), 111-128.
16. H. Hirai and K. Murota, M-convex functions and tree metrics, Japan J. Indust. Appl. Math. 21 (2004), 391-403.
17. J. R. Isbell, Six theorems about injective metric spaces, Comment. Math. Helv. 39 (1964), 65-76.
18. J. Koolen, V. Moulton, and U. Tönges, The coherency index, Discrete Math. 192 (1998), 205-222.
19. L. Lovász, Submodular functions and convexity, in Mathematical Programming - The State of the Art (A. Bachem, M. Grötschel, and B. Korte, eds.), Springer-Verlag, Berlin, 1983, pp. 235-257.
20. K. Murota, Discrete Convex Analysis, SIAM, Philadelphia, PA, 2003.
21. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
22. R. Schneider, Convex Bodies: The Brunn-Minkowski Theory, Cambridge University Press, Cambridge, 1993.
23. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
24. C. Semple and M. Steel, Phylogenetics, Oxford University Press, Oxford, 2003.
25. B. Sturmfels, Gröbner Bases and Convex Polytopes, American Mathematical Society, Providence, RI, 1996.
26. B. Sturmfels and J. Yu, Classification of six-point metrics, Electron. J. Combin. 11 (2004), R44.
27. G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, New York, 1995.