Pages that link to "Item:Q372959"
From MaRDI portal
The following pages link to The complexity of computing minimal unidirectional covering sets (Q372959):
Displaying 4 items.
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- King-chicken choice correspondences (Q2108774) (← links)
