Eecient Parallel Algorithms for Modular Decomposition and Split Decomposition of Chordal Graphs


We present e cient parallel algorithms for the modular decomposition and split decomposition of chordal graphs, provided a representation as a collection of subtrees of a tree is known. The running time is logarithmic and the processor number is linear. 0 Introduction By a module we mean a subset V0 of the vertices of a graphG = (V;E) such that all vertices… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics