A characterization of chain probe graphs

被引：7
|
作者：
Golumbic, Martin C. [1 ,3 ,4 ]
Maffray, Frederic [2 ]
Morel, Gregory
机构：
[1] Univ Haifa, Caesarea Rothschild Inst & Dept Comp Sci, Haifa, Israel
[2] CNRS, Lab G SCOP, Grenoble, France
[3] Univ Haifa, Caesarea Rothschild Inst, IL-31999 Haifa, Israel
[4] Univ Haifa, Dept Comp Sci, IL-31999 Haifa, Israel
来源：
ANNALS OF OPERATIONS RESEARCH | 2011年 / 188卷 / 01期
关键词：
RECOGNITION;
D O I：
10.1007/s10479-009-0584-6
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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 2K (2)-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(n (2)) recognition algorithm.
引用
收藏
页码：175 / 183
页数：9
相关论文
共 50 条
12345