AI RESEARCH
Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
arXiv CS.LG
•
ArXi:2602.00657v2 Announce Type: replace-cross Kirkpatrick [ALT 2019] and Fallat [JMLR 2023] In this work, we consider (positive) non-clashing teaching for closed neighborhoods in graphs. This concept class is not only extensively studied in various related contexts, but it also exhibits broad generality, as any finite binary concept class can be equivalently represented by a set of closed neighborhoods in a graph.