Efficient Algorithms for Learning Monophonic Halfspaces in Graphs

Monophonic halfspaces, a notion related to linear separability and convexity in graphs, can be learned efficiently in the realizable and agnostic PAC settings, as well as in the realizable active and online learning settings.