{'fraction_non_alphanumeric': 0.01908957415565345, 'fraction_numerical': 0.0, 'mean_word_length': 4.879310344827586, '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}}
Routing Problems in Incomplete Pancake Graphs

A pancake graph was proposed as a topology for interconnection networks of parallel computers, and it has a merit that it can connect many nodes with small diameter and small degree. However, the number of nodes in a pancake graph must be equal to the factorial of an integer, which causes a demerit that it lacks incremental expandability. Hence, in this paper, we propose a graph, an incomplete pancake graph, that is obtained by deleting some of sub graphs of a pancake graph, and we give algorithms for the problems of the simple routing, the Hamiltonian cycle, the Hamiltonian path, and the container in incomplete pancake graphs