k-Probe DH-graphs
Data Structures and Algorithms
2012-02-03 v2
Abstract
Let k be a natural number. Let G be a graph and let N_1,...,N_k be k independent sets in G. The graph G is k-probe distance hereditary if G can be embedded into a DH-graph by adding edges between vertices that are contained in the same independent set. We show that there exists a polynomial-time algorithm to check if a graph G is k-probe distance hereditary.
Cite
@article{arxiv.1201.6207,
title = {k-Probe DH-graphs},
author = {T. Kloks},
journal= {arXiv preprint arXiv:1201.6207},
year = {2012}
}
Comments
We are working on an improved description of these results