Skeletons, recognition algorithm and distance matrix of quasi-median graphs

References

• Atallah , M. J. , Chen , D. Z. and Lee , D. T. Proc. of the First Annual European Symposium on Algorithms-ESA '93 . An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications . pp. 13 – 24 . Springer .
   Google Scholar
• Avann , S. P. 1961 . Metric ternarly distributive semi-lattices . Proc. Amer. Math. Soc. , 12 : 407 – 414 .
   Google Scholar
• Aurenhammer , A. and Hagauer , J. 1991 . Recognizing binary Hamming graphs in O(n ² log n) time, Lecture Notes in Computer Science , Vol. 484 , 90 – 98 . New York : Springer .
   Google Scholar
• Bandelt , H. J. 1984 . Retracts of hypercubes . J. Graph Theory , 8 : 501 – 510 .
   Web of Science ®Google Scholar
• Bandelt , H. J. , Mulder , H. M. and Wilkeit , E. Quasi-median graphs and algebras . J. of Graph Theory , to appear in
   Web of Science ®Google Scholar
• Chung , F. R. K. , Graham , R. L. and Saks , M. E. “ Dynamic search in graphs ” . In Discrete algorithms and complexity , Edited by: Wilf , H. 351 – 387 . New York : Academic Press .
   Google Scholar
• Chung , F. R. K. , Graham , R. L. and Saks , M. E. 1989 . A dynamic location problem for graphs, Combinatorica , 9 : 111 – 132 .
   Google Scholar
• Dress , A. and Scharlau , R. 1987 . Gated sets in metric spaces . Aequationes Math. , 34 : 112 – 120 .
   Google Scholar
• Feder , T. 1992 . Product graph representations . J. Graph Theory , 16 : 467 – 488 .
   Web of Science ®Google Scholar
• Hagauer , J. , Imrich , W. and Klavžar , S. 1993 . Recognizing graphs of windex 2 . Univ. of Ljubljana , 31 ( 410 ) preprint series
   Google Scholar
• Imrich , W. and Klavžar , S. 1993 . A simple O(mn) algorithm for recognizing Hamming graphs . Bull. Inst. Combin. Appl. , 9 : 45 – 56 .
   Google Scholar
• Jha , P. K. and Slutzki , G. 1992 . Convex-expansions algorithms for recognizing and isometric embedding of median graphs . Ars Combin. , 34 : 75 – 92 .
   Web of Science ®Google Scholar
• Mulder , H. M. 1978 . The structure of median graphs . Discrete Math. , 24 : 197 – 204 .
   Web of Science ®Google Scholar
• Mulder , H. M. 1980 . “ The Interval Function of a Graph ” . In Mathematical Centre Tracts 132 , Amsterdam : Mathematisch centrum .
   Google Scholar
• Nebeský , L. 1971 . Median graphs . Comment. Math. Univ. Carolinae , 12 : 317 – 325 .
   Google Scholar
• Seidel , R. 1992 . On the all-pairs-shortest-path problem . Proc. STOC , : 745 – 749 .
   Google Scholar
• Wilkeit , E. 1992 . The retracts of Hamming graphs . Discrete Math. , 102 : 197 – 218 .
   Web of Science ®Google Scholar