Pages that link to "Item:Q3956416"
From MaRDI portal
The following pages link to A 1-matching blossom-type algorithm for edge covering problems (Q3956416):
Displaying 9 items.
- Edge covering problem under hybrid uncertain environments (Q371513) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Fuzzy minimum weight edge covering problem (Q1031614) (← links)
- Forest covers and a polyhedral intersection theorem (Q1121807) (← links)
- Constrained weighted matchings and edge coverings in graphs (Q1304484) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)