Skip to Main content Skip to Navigation
New interface
Conference papers

From parallel comparability graph recognition and modular decomposition

Abstract : A parallelization of the algorithm of Golumbic for recognizing comparability graphs is proposed for the concurrent parallel random access machine (CRCW PRAM). Parallel algorithms for finding a transitive orientation and the modular decomposition of any undirected graph are deduced from an extension of the theory of Golumbic toward modular decomposition. The algorithms for recognizing and transitively orienting comparability graphs run in O(log n) time using d m processors and the modular decomposition algorithm runs in O(log n) time using n^3 processors (n, m and d respectively denote the number of vertices, the number of edges and the maximal degree of the undirected input graph).
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Thursday, April 8, 2010 - 4:13:15 PM
Last modification on : Saturday, November 20, 2021 - 3:50:10 AM
Long-term archiving on: : Friday, July 9, 2010 - 9:17:37 PM


Files produced by the author(s)



Michel Morvan, Laurent Viennot. From parallel comparability graph recognition and modular decomposition. 13th Symposium on Theoretical Aspects of Computer Science (STACS), 1996, Grenoble, France. pp.169-180, ⟨10.1007/3-540-60922-9_15⟩. ⟨inria-00471608⟩



Record views


Files downloads