A note on probe cographs
Data Structures and Algorithms
2012-02-03 v1
Abstract
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.
Cite
@article{arxiv.1202.0364,
title = {A note on probe cographs},
author = {Ton Kloks},
journal= {arXiv preprint arXiv:1202.0364},
year = {2012}
}