{'fraction_non_alphanumeric': 0.026578073089700997, 'fraction_numerical': 0.008305647840531562, 'mean_word_length': 4.336283185840708, '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}}
The 1-Center Problem: Exploiting Block Structure

A block of a graph is a maximal nonseparable subgraph. We show how the knowledge of block structure can be used to help solve the nonlinear 1-center problem on graphs which are more general than trees. We give an efficient algorithm which either finds a unique 1-center at some vertex, or else localizes the search for all 1-centers to a single block. The algorithm makes use of an associated graph, called a blocking graph, which is a tree, and iteratively orients arcs in the blocking graph to “point the way” to a block which contains all 1-centers.