The PIGs Full Monty – A Floor Show of Minimal Separators [chapter]

Gerard Jennhwa Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng
2005 Lecture Notes in Computer Science  
Given a class of graphs G, a graph G is a probe graph of G if its vertices can be partitioned into two sets P (the probes) and N (nonprobes), where N is an independent set, such that G can be embedded into a graph of G by adding edges between certain vertices of N. We show that the recognition problem of probe interval graphs, i.e., probe graphs of the class of interval graphs, is in P.
doi:10.1007/978-3-540-31856-9_43 fatcat:mrvgdp2fxrgmjiuj6iss4nkfdm