Pages that link to "Item:Q299061"
From MaRDI portal
The following pages link to The cost of perfection for matchings in graphs (Q299061):
Displaying 3 items.
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids (Q290099) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching (Q2032967) (← links)