Pages that link to "Item:Q2254544"
From MaRDI portal
The following pages link to Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544):
Displaying 14 items.
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- Certain NP-complete matching problems (Q794163) (← links)
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On the sets of perfect matchings for two bipartite graphs (Q1606933) (← links)
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)