PRACTICAL PARALLEL ALGORITHMS FOR CHORDAL GRAPHS

Until recently, a large majority of theoretical work in parallel algorithms has ignored communication costs and other realities of parallel computing. This paper attempts to address this issue by developing parallel algorithms that not only are efficient using standard theoretical analysis techniques, but also require a minimal amount of communication. The specific parallel algorithms developed here include one to find the set of maximal cliques and one to find a perfect elimination ordering of a choral graph.