Pages that link to "Item:Q2637345"
From MaRDI portal
The following pages link to Complexity results for rainbow matchings (Q2637345):
Displayed 9 items.
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- Color-line and proper color-line graphs (Q2174556) (← links)
- Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- (Q5089171) (← links)
- Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)