Pages that link to "Item:Q1903945"
From MaRDI portal
The following pages link to Methods of finding all minimum coverings of a graph by cliques (Q1903945):
Displaying 4 items.
- Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- (Q3011753) (← links)
- Assignment-minimum clique coverings (Q5406263) (← links)