License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12703
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1270/
Go to the corresponding Portal


Le, Van Bang ; de Ridder, H.N.

Linear-time certifying recognition for partitioned probe cographs

pdf-format:
Document 1.pdf (108 KB)


Abstract

Cographs are those graphs without induced path on four vetices. A graph $G=(V, E)$ with a partition $V=Pcup N$ where $N$ is an independent set is a partitioned probe cograph if one can add new edges between certain vertices in $N$ in such a way that the graph obtained is a cograph. We characterize partitioned probe cographs in terms of five forbidden induced subgraphs. Using this characterization, we give a linear-time recognition algorithm for partitioned probe cographs. Our algorithm produces a certificate for membership that can be checked in linear time and a certificate for non-membership that can be checked in sublinear time.

BibTeX - Entry

@InProceedings{le_et_al:DSP:2007:1270,
  author =	{Van Bang Le and H.N. de Ridder},
  title =	{Linear-time certifying recognition for partitioned probe cographs},
  booktitle =	{Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes},
  year =	{2007},
  editor =	{Andreas Brandst{\"a}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad},
  number =	{07211},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1270},
  annote =	{Keywords: Cograph, probe cograph, certifying graph algorithm}
}

Keywords: Cograph, probe cograph, certifying graph algorithm
Seminar: 07211 - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes
Issue Date: 2007
Date of publication: 14.12.2007


DROPS-Home | Fulltext Search | Imprint Published by LZI