Pages that link to "Item:Q794163"
From MaRDI portal
The following pages link to Certain NP-complete matching problems (Q794163):
Displaying 12 items.
- The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Complexity of matching problems (Q1099615) (← links)
- An unfeasible matching problem (Q1182611) (← links)
- Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544) (← links)
- \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (Q2628277) (← links)
- Computational complexity of existence problems for matchings in graphs. (Q2756482) (← links)
- (Q3785940) (← links)
- On the completeness of a generalized matching problem (Q5402563) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)