Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings