Pages that link to "Item:Q2935383"
From MaRDI portal
The following pages link to Hardness and approximation of minimum maximal matchings (Q2935383):
Displaying 12 items.
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- The balance problem of min-max systems is co-nNP hard (Q2503672) (← links)
- \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (Q2628277) (← links)
- (Q3139770) (← links)
- (Q3161275) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)