STACS 2005
From MaRDI portal
Publication:5710704
DOI10.1007/b106485zbMath1118.68509OpenAlexW4230940848MaRDI QIDQ5710704
Ji Ping Liu, Antonius J. J. Kloks, Sheng-Lung Peng, Gerard Jennhwa Chang
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Related Items (8)
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Characterizing interval graphs which are probe unit interval graphs ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Probe Ptolemaic Graphs ⋮ Recognition of probe proper interval graphs ⋮ Partitioned probe comparability graphs ⋮ Recognition of Probe Ptolemaic Graphs ⋮ Linear-Time Recognition of Probe Interval Graphs
This page was built for publication: STACS 2005
