{'fraction_non_alphanumeric': 0.04285714285714286, 'fraction_numerical': 0.008928571428571428, 'mean_word_length': 4.5, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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/sup 2/ n) time using O(mn) processors on a CRCW PRAM model and O(log/sup 2/ n) time using O(m) processors on a CREW PRAM model, respectively.