Probe split graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2007

Probe split graphs


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(V4(V+E)) time recognition algorithm for probe split graphs. In this article we give O(V2+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.
Fichier principal
Vignette du fichier
713-2533-1-PB.pdf (387.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00966503 , version 1 (26-03-2014)



van Bang Le, H. N. De Ridder. Probe split graphs. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 1 (1), pp.207--238. ⟨10.46298/dmtcs.401⟩. ⟨hal-00966503⟩


41 View
784 Download



Gmail Facebook Twitter LinkedIn More