Complexity of a disjoint matching problem on bipartite graphs

Gregory J. Puleo. Complexity of a disjoint matching problem on bipartite graphs. Inf. Process. Lett., 116(10):649-652, 2016. [doi]

Authors

Gregory J. Puleo

This author has not been identified. Look up 'Gregory J. Puleo' in Google