Van Bang Le ; H. N. Ridder - Probe split graphs

dmtcs:401 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 1 - https://doi.org/10.46298/dmtcs.401
Probe split graphsArticle

Authors: Van Bang Le ; H. N. Ridder 1

  • 1 Institut für Informatik [Rostock]

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.


Volume: Vol. 9 no. 1
Section: Graph and Algorithms
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 386 times.
This article's PDF has been downloaded 582 times.