Linear-time certifying recognition for partitioned probe cographs

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

doi:10.4230/DagSemProc.07211.2

Document

Linear-time certifying recognition for partitioned probe cographs

Authors Van Bang Le, H.N. de Ridder

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 7211
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2007-12-14

PDF

File

PDF

DagSemProc.07211.2.pdf

Filesize: 107 kB
4 pages

Document Identifiers

DOI: 10.4230/DagSemProc.07211.2
URN: urn:nbn:de:0030-drops-12703

Subject Classification

Keywords

Cograph
probe cograph
certifying graph algorithm

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Van Bang Le and H.N. de Ridder. Linear-time certifying recognition for partitioned probe cographs. In Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Dagstuhl Seminar Proceedings, Volume 7211, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.07211.2

Author Details

Van Bang Le

H.N. de Ridder

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail