In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances in any connected induced subgraph are the same as they are in the original graph. Thus, any induced subgraph inherits the distances of the larger graph.
A graph is a probe distance-hereditary graph if its vertex set can be partitioned into two sets, probes (P) and non-probes (N), such that N is independent ...
A graph is distance hereditary if the distance between any two vertices remains the same in every connected induced subgraph. Bipartite distance-hereditary ...
A graph is distance hereditary if the dis- tance between any two vertices remains the same in every connected induced subgraph. Distance- hereditary graphs have ...
A graph is a probe bipartite distance-hereditary graph if its vertex set can be partitioned into two sets, probes (P) and non-probes (N), such that N is ...
By definition graph class G is a subclass of probe G graphs. A graph is distance hereditary if the distance between any two vertices remains the same in every ...
We give the first polynomial-time algorithm for recognizing partitioned probe distance-hereditary graphs. By using a novel data structure for storing a multiset ...
This paper gives an O(nm)-time algorithm for recognizing probe graphs of distance-hereditary graphs, a type of graph that is distance hereditary and has ...
In this paper, we investigate distance-hereditary graphs. This class of graphs consists of isometric graphs and hence contains trees and cographs. First, a ...
By definition graph class is a subclass of probe graphs. A graph is distance hereditary if the distance between any two vertices remains the same in every ...