k-Probe DH-graphs
Abstract
Let k be a natural number. Let G be a graph and let N1,...,Nk 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.