Abstract
Given a class of graphs script G sgin, a graph G is a probe graph of script G sgin if its vertices can be partitioned into two sets ℙ (the probes) and ℕ (non-probes), where ℕ is an independent set, such that G can be embedded into a graph of script G sgin by adding edges between certain vertices of ℕ. We show that the recognition problem of probe interval graphs, i.e., probe graphs of the class of interval graphs, is in P. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Chang, G. J., Kloks, A. J. J., Liu, J., & Peng, S. L. (2005). The PIGs full monty - A floor show of minimal separators. In Lecture Notes in Computer Science (Vol. 3404, pp. 521–532). Springer Verlag. https://doi.org/10.1007/978-3-540-31856-9_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
