Methods of finding all minimum coverings of a graph by cliques

zbMath0835.68088MaRDI QIDQ1903945

V. P. Cherenin, E. V. Brattseva

Publication date: 7 March 1996

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

bichromatic graph algorithmscanning methods

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Neighborhood search heuristics for the uncapacitated facility location problem