LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem


For an undirected graph G the kth power G of G is the graph with the same vertex set as G where two vertices are adjacent i their distance is at most k in G. In this paper we prove that every LexBFS-ordering of a distance-hereditary graph is both a common perfect elimination ordering of all even powers and a common semi-simplicial ordering of all powers of… (More)
DOI: 10.1016/S0166-218X(99)00157-2

3 Figures and Tables


  • Presentations referencing similar topics