Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance and Bipartite Probe Interval Graphs
Document Type
Article
Journal/Book Title/Conference
Discrete Mathematics and Theoretical Computer Science
Volume
12
Issue
5
Publication Date
2010
First Page
63
Last Page
82
Abstract
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with an interval associated to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is a probe. A graph G = (V,E) is a tolerance graph if each vertex v ∈V can be associated to an interval Iv of the real line and a positive real number tv such that uv ∈E if and only if |Iu ∩Iv| ≥ min (tu,tv). In this paper we present O(|V| + |E|) recognition algorithms for both bipartite probe interval graphs and bipartite tolerance graphs. We also give a new structural characterization for each class which follows from the algorithms.
Recommended Citation
Brown, D. E., A. H. Busch and G. Isaak, Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance and Bipartite Probe Interval Graphs, Discrete Mathematics and Theoretical Computer Science, Vol 12:5 (2010) 63 - 82.
