The following pages link to (Q3976656):
Displaying 10 items.
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q2413142) (← links)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- Discontinuities in the complexities of some graph recognition problems (Q2848780) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- (Q3128905) (← links)
- (Q4452099) (← links)