Pages that link to "Item:Q2629777"
From MaRDI portal
The following pages link to Complexity of a disjoint matching problem on bipartite graphs (Q2629777):
Displaying 9 items.
- Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- (Q3976656) (← links)
- The complexity of short schedules for uet bipartite graphs (Q4497865) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)
- (Q5463498) (← links)