246 followers
Day 22 of #DailyMLMIA : Bipartite matching is a classic graph problem. What if not allowing crossing edges in matching? This is useful when neighbor relation is critical, eg when studying nbrs of a cell in a colony. Optimal noncrossing bipartite matching: