eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2007-12-14
7211
1
14
10.4230/DagSemProc.07211.1
article
07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes
Brandstädt, Andreas
Jansen, Klaus
Kratsch, Dieter
Spinrad, Jeremy P.
From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes'' was held
in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07211/DagSemProc.07211.1/DagSemProc.07211.1.pdf
Graph theory
approximation algorithms
certifying algorithms
exact algorithms
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2007-12-14
7211
1
4
10.4230/DagSemProc.07211.2
article
Linear-time certifying recognition for partitioned probe cographs
Le, Van Bang
de Ridder, H.N.
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07211/DagSemProc.07211.2/DagSemProc.07211.2.pdf
Cograph
probe cograph
certifying graph algorithm