A fast parallel algorithm to recognize P4-sparse graphs Original Research Article

A number of problems in mobile computing, group-based collaboration, automated theorem proving, networking, scheduling, and cluster analysis suggested the study of graphs featuring certain “local density” characteristics. Typically, the notion of local density is equated with the absence of chordless paths of length three or more. Recently, a new metric for local density has been proposed, allowing a number of such induced paths to occur. More precisely, a graphG is called P4-sparse if no set of five vertices inG induces more than one chordless path of length three. P4-sparse graphs generalize the well-known class of cographs corresponding to a more stringent local density metric. One remarkable feature of P4-sparse graphs is that they admit a tree representation unique up to isomorphism. In this work we present a parallel algorithm to recognize P4-sparse graphs and show how the data structures returned by the recognition algorithm can be used to construct the corresponding tree representation. With a graphG= (V, E) with¦V¦=n and¦E¦= m as input, our algorithms run inO(logn) time usingO((n2 + mn)/ log n) processors in the EREW-PRAM model.