{'fraction_non_alphanumeric': 0.02390998593530239, 'fraction_numerical': 0.0, 'mean_word_length': 5.033898305084746, '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}}
Detecting hubs and quasi cliques in scale-free networks

Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In this paper, we model hubs as high-degree nodes and communities as quasi cliques. We propose a new problem formulation called the ¿-list dominating set and show how this single problem is suited to model both the structures in real-world networks better than traditional problems like vertex cover and clique. Additionally, we provide a fixed-parameter tractable algorithm to this detect these structures and show experimental results on protein-protein interaction networks.