Peakless functions on graphs

Discrete Applied Mathematics

Volumn 73, Issue 2, 1997, Pages 175-189

  Chepoi, Victor ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Geodesies; Graphs; Maximum cardinality search; Peakless functions

Indexed keywords

EID: 0040687754     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00007-8     Document Type: Article

References (28)

1. P. Buneman, A characterization of rigid circuit graphs, Discrete Math. 9 (1974) 205-212.
2. H. Busemann, The Geometry of Geodesics (Academic Press, New York, 1955).
3. H. Busemann and B.B. Phadke, Peakless and monotone functions on G-spaces, Tsukuba J. Math. 7 (1983) 105-135.
4. V. Chepoi, Some properties of convex functions on graphs (in Russian), preprint Moldova State University (1986).
5. P.M. Dearing, R.L. Francis and T.J. Lowe, Convex location problems on tree networks, Oper. Res. 24 (1976) 628-642.
6. R. Diestel, Simplicial decompositions of graphs: a survey of applications, Discrete Math. 75 (1989) 121-144.
7. R. Diestel, Graph Decompositions - A Study in Infinite Graph Theory (Oxford Univ. Press, Oxford, 1990).
8. R. Diestel, Simplicial tree-decompositions of infinite graphs I, II, III, J. Combin. Theory B 48 (1990) 197-215: Ser. B50 (1990) 93-116, 117-128.
9. R. Diestel, Simplicial tree-decompositions of infinite graphs I, II, III, J. Combin. Theory B 48 (1990) 197-215: Ser. B50 (1990) 93-116, 117-128.
10. G.A. Dirac, Simplicial decompositions of infinite graphs, in: Combinatorica, Conv. Roma 1983, Sympos. Math. 28 (1986) 159-195.
11. M. Farber and R.E. Jamison, Convexity in graphs and hypergraphs, SIAM J. Algebraic Discrete Methods 7 (1986) 433-444.
12. R. Halin, Simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen, Math. Ann. 156 (1964) 216-225.
13. R. Halin, Graphentheorie II (Wissenschaftliche Buchgesellschaft, Darmstadt, 1981).
14. E. Howorka, A characterization of Ptolemaic graphs. J. Graph Theory 5 (1984) 321-323.
15. N. Innami, A classification of Busemann G-surfaces which possess convex functions. Acta Math. 148 (1982) 15-29.
16. B. Jamison and S. Olariu, P-components and the homogeneous decomposition of graphs, SIAM J. Discrete Math. 8 (1995) 448-463.
17. R.E. Jamison-Waldner, A perspective on abstract convexity: classifying alignments by varietes, in: Convexity and related Combinatorial Geometry, Proceedings of the 2nd University of Oklahoma Conference (Dekker, New York, 1982) 113-150.
18. R.H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in: I. Rival, ed., Graphs and Order (Dordrecht, Holland, 1985).
19. R.H. Möhring and F.J. Rademacher, Substitution decomposition and connections with combinatorial optimization, Ann. Discrete Math. 19 (1984) 257-356.
20. J.H. Muller and J. Spinrad, Incremental modular decomposition, J. Assoc. Comput. Math. 36 (1989) 1-19.
21. D.R. Shier, Some aspects of perfect elimination orderings in chordal graphs, Discrete Appl. Math. 7 (1984) 325-331.
22. V. Soltan, Some properties of d-convex functions, I, II (in Russian), Bull. Moldavian Acad. Sci. Ser. Math. 2 (1980) 27-31; 1 (1981) 21-26.
23. V. Soltan, Some properties of d-convex functions, I, II (in Russian), Bull. Moldavian Acad. Sci. Ser. Math. 2 (1980) 27-31; 1 (1981) 21-26.
24. V.P. Soltan, Introduction to the Axiomatic Theory of Convexity (in Russian) (Ştiinţa, Chişinǎu, 1984).
25. V. Soltan and P. Soltan, d-Convex functions (in Russian), Soviet Math. Dokl. 249 (1979) 555-558.
26. V. Soltan and V. Chepoi, Some classes of d-convex functions in graphs (in Russian), Soviet Math. Dokl. 273 (1983) 1314-1317.
27. R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-579.
28. M. van de Vel, Theory of Convex Structures (Elsevier, Amsterdam, 1993).