Pages that link to "Item:Q2756482"
From MaRDI portal
The following pages link to Computational complexity of existence problems for matchings in graphs. (Q2756482):
Displaying 6 items.
- Certain NP-complete matching problems (Q794163) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Complexity of matching problems (Q1099615) (← links)
- On the completeness of a generalized matching problem (Q5402563) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)