%0 Journal Article
%T Probe split graphs
%A Van Bang Le
%A H.N. de Ridder
%J Discrete Mathematics & Theoretical Computer Science
%D 2007
%I Discrete Mathematics & Theoretical Computer Science
%X An undirected graph G=(V,E) is a probe split graph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and there exists E'   N¡Á N such that G'=(V,E¡È E') is a split graph. Recently Chang et al. gave an O(V 4 (V+E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +VE) time recognition algorithms and characterisations by forbidden induced subgraphs both for the case when the partition into probes and non-probes is given, and when it is not given.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/713