Recognizing median graphs in subquadratic time

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 123-136

  Hagauer, Johann ^a   Imrich, Wilfried ^b   Klavžar, Sandi ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF LEOBEN   (Austria)

^c UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011324625     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00136-9     Document Type: Article

References (23)

1. F. Aurenhammer, M. Formann, R. Idury, A. Schäffer, F. Wagner, Faster isometric embeddings in products of complete graphs, Discrete Appl. Math. 52 (1994) 17-28.
2. 2 log n) time, Lecture Notes in Computer Science, vol. 484, Springer, New York, 1991, pp. 90-98; also Math. Systems Theory 28 (1995) 387-396.
3. 2 log n) time, Lecture Notes in Computer Science, vol. 484, Springer, New York, 1991, pp. 90-98; also Math. Systems Theory 28 (1995) 387-396.
4. S.P. Avann, Metric ternary distributive semi-lattices, Proc. Amer. Math. Soc. 12 (1961) 407-414.
5. H.J. Bandelt, Retracts of hypercubes, J. Graph Theory 8 (1984) 501-510.
6. H.J. Bandelt, J.P. Barthélemy, Medians in median graphs, Discrete Appl. Math. 8 (1984) 131-142.
7. H.J. Bandelt, H.M. Mulder, Infinite median graphs, (0,2)-graphs, and hypercubes, J. Graph Theory 7 (1983) 487-497.
8. F.R.K. Chung, R.L. Graham, M.E. Saks, Dynamic search in graphs, in: H. Wilf (Ed.), Discrete Algorithms and Complexity, Academic Press, New York, 1987, pp. 351-387.
9. F.R.K. Chung, R.L. Graham, M.E. Saks, A dynamic location problem for graphs, Combinatorica 9 (1989) 111-132.
10. D. Duffus, I. Rival, Graphs orientable as distributive lattices, Proc. Amer. Math. Soc. 88 (1983) 197-200.
11. T. Feder, Product graph representations, J. Graph Theory 16 (1992) 467-488.
12. R.L. Graham, On primitive graphs and optimal vertex assignments, Ann. New York Acad. Sci. 175 (1970) 170-186.
13. W. Imrich, S. Klavžar, A simple O(mn) algorithm for recognizing Hamming graphs, Bull. Inst. Comb. Appl. 9 (1993) 45-56.
14. W. Imrich, S. Klavžar, On the complexity of recognizing Hamming graphs and related classes of graphs, European J. Combin. 17 (1996) 209-221.
15. W. Imrich, S. Klavžar, A convexity lemma and expansion procedures for bipartite graphs, manuscript, 1997.
16. 2 log n) algorithm for recognizing median graphs, manuscript, 1989.
17. P.K. Jha, G. Slutzki, Convex-expansions algorithms for recognizing and isometric embedding of median graphs, Ars Combin. 34 (1992) 75-92.
18. F.R. McMorris, H.M. Mulder, F.S. Roberts, The median procedure on median graphs, Report 9413/B, Econometric Institute, Erasmus University Rotterdam.
19. H.M. Mulder, The structure of median graphs, Discrete Math. 24 (1978) 197-204.
20. H.M. Mulder, The Interval Function of a Graph, Mathematical Centre Tracts, vol. 132, Mathematisch Centrum, Amsterdam, 1980.
21. H.M. Mulder, n-Cubes and median graphs, J. Graph Theory 4 (1980) 107-110.
22. H.M. Mulder, A. Schrijver, Median graphs and Helly hypergraphs, Discrete Math. 25 (1979) 41-50.
23. L. Nebeský, Median graphs, Comment. Math. Univ. Carolinae 12 (1971) 317-325.