Computing and Combinatorics

DOI10.1007/11533719zbMath1128.05313OpenAlexW4376561447MaRDI QIDQ5717004

Ton Kloks, Sheng-Lung Peng, Ji Ping Liu, Dieter Kratsch, Maw-Shang Chang

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items (14)

On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Adjacency matrices of probe interval graphs ⋮ On the forbidden induced subgraph probe and sandwich problems ⋮ The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Probe Ptolemaic Graphs ⋮ The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ On the forbidden induced subgraph sandwich problem ⋮ A characterization of chain probe graphs ⋮ Partitioned probe comparability graphs ⋮ On probe permutation graphs ⋮ On the bi-enhancement of chordal-bipartite probe graphs ⋮ Probe threshold and probe trivially perfect graphs

This page was built for publication: Computing and Combinatorics