Le, Van Bang and Ridder, H. N., - Probe split graphs

dmtcs:401 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 1
Probe split graphs

Authors: Le, Van Bang and Ridder, H. N.,

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.


Source : oai:HAL:hal-00966503v1
Volume: Vol. 9 no. 1
Section: Graph and Algorithms
Published on: January 1, 2007
Submitted on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 44 times.
This article's PDF has been downloaded 46 times.