{'fraction_non_alphanumeric': 0.024242424242424242, 'fraction_numerical': 0.0, 'mean_word_length': 5.295238095238095, '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}}
Classroom Note. Contributions of Graphs to Staff Rostering

Various models have been developed for the “rostering problem,” that is, the problem of generating a feasible high-quality schedule (‘roster’) for staff members at a company or business. Such models are typically solved by integer-programming techniques. In this paper, we show how graphs contribute to an overall solution method for these types of problems. Our objective is to give students in an undergraduate discrete mathematics or graph theory course preliminary exposure to rostering problems and solution methods as well as to provide exercises that reinforce the graph application component.