A note on probe cographs

Details A note on probe cographs A note on probe cographs

2012-02-02

arxiv.org/abs/1202.0364v1

Computer Science

Data Structures and Algorithms

Scientific paper

Let G be a graph and let N_1, ..., N_k be k independent sets in G. The graph
G is a k-probe cograph if G can be embedded into a cograph by adding edges
between vertices that are contained in the same independent set. We show that
there exists an O(k n^5) algorithm to check if a graph G is a k-probe cograph.

Affiliated with

Also associated with

No associations

Rating

A note on probe cographs 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 A note on probe cographs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on probe cographs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187058