Recognizing and representing proper interval graphs in parallel using merging and sorting

We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number of edges and vertices in the graph. The algorithm uses sorting to compute a weak linear ordering of the vertices, from which an interval representation is easily obtained. It is simple, uses no complex data structures, and extends ideas from an optimal sequential algorithm for recognizing and representing a proper interval graph [DHH96].

• Type: Journal
• Year: 2007
• Where: DAM
• Authors: Jørgen Bang-Jensen, Jing Huang, Louis Ibarra
• Keywords: Algorithm, DAM 2007, Parallel Algorithm, Proper Interval Graph