Pages that link to "Item:Q1068535"
From MaRDI portal
The following pages link to On the complexity of a family of generalized matching problems (Q1068535):
Displaying 7 items.
- The minimum maximal k-partial-matching problem (Q395867) (← links)
- Certain NP-complete matching problems (Q794163) (← links)
- Complexity of matching problems (Q1099615) (← links)
- The Complexity of Rationalizing Matchings (Q3596716) (← links)
- (Q4263472) (← links)
- On the completeness of a generalized matching problem (Q5402563) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)