Parallel algorithms for Hamiltonian 2-separator chordal graphs

In this paper we propose a parallel algorithm to construct a one-sided monotone polygon from a Hamiltonian 2-sep chordal graph which takes O(log n) time and uses O(n) processors on a CREW PRAM model. We also propose parallel algorithms to recognize Hamiltonian 2-sep chordal graphs and to construct a Hamiltonian cycle in such a graph, which run in O(log² n) time using O(mn) processors on a CRCW PRAM model and O(log² n) time using O(m) processors on a CREW PRAM model, respectively