Probe split graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2007

Probe split graphs

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩

Collections

TDS-MACS
44 Consultations
906 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More