k-Probe DH-graphs

Details k-Probe DH-graphs k-Probe DH-graphs

2012-01-30

arxiv.org/abs/1201.6207v2

Computer Science

Data Structures and Algorithms

We are working on an improved description of these results

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

k-Probe DH-graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with k-Probe DH-graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-Probe DH-graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359556