论文信息 - Optimal partition of a bipartite graph into non-crossing matchings - 字舞流文

Optimal partition of a bipartite graph into non-crossing matchings

Federico Malucelli | Sara Nicoloso

[1] Federico Malucelli,et al. Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem , 1993, Discret. Appl. Math..

[2] Dominique de Werra. Decomposition of bipartite multigraphs into matchings , 1972, Z. Oper. Research.