A characterization of chain probe graphs

Martin C. Golumbic; Frédéric Maffray; Grégory Morel

doi:10.1007/s10479-009-0584-6

A characterization of chain probe graphs

Martin C. Golumbic, Frédéric Maffray, Grégory Morel

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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₂-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²) recognition algorithm.

Original language	English
Pages (from-to)	175-183
Number of pages	9
Journal	Annals of Operations Research
Volume	188
Issue number	1
DOIs	https://doi.org/10.1007/s10479-009-0584-6
State	Published - Aug 2011

ASJC Scopus subject areas

General Decision Sciences
Management Science and Operations Research

Access to Document

10.1007/s10479-009-0584-6

Cite this

@article{396810f60f2f4f6d82fd99c218ee2dfc,

title = "A characterization of chain probe graphs",

abstract = "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.",

author = "Golumbic, {Martin C.} and Fr{\'e}d{\'e}ric Maffray and Gr{\'e}gory Morel",

year = "2011",

month = aug,

doi = "10.1007/s10479-009-0584-6",

language = "English",

volume = "188",

pages = "175--183",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - A characterization of chain probe graphs

AU - Golumbic, Martin C.

AU - Maffray, Frédéric

AU - Morel, Grégory

PY - 2011/8

Y1 - 2011/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79960844183&partnerID=8YFLogxK

U2 - 10.1007/s10479-009-0584-6

DO - 10.1007/s10479-009-0584-6

M3 - Article

AN - SCOPUS:79960844183

SN - 0254-5330

VL - 188

SP - 175

EP - 183

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 1

ER -

A characterization of chain probe graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this