A chain probe graph is a graph that admits an independent set S of vertices and a set F of pairs of elements of S such that G+F is a chain graph (i. e., a 2K2-free bipartite graph). We show that chain probe graphs are exactly the bipartite graphs that do not contain as an induced subgraph a member of a family of six forbidden subgraphs, and deduce an O(n2) recognition algorithm.
|Number of pages||9|
|Journal||Annals of Operations Research|
|State||Published - Aug 2011|
ASJC Scopus subject areas
- Decision Sciences (all)
- Management Science and Operations Research