Methods of finding all minimum coverings of a graph by cliques

MaRDI QIDQ1903945zbMATH OpenFDO

Authors E. V. Brattseva, V. P. Cherenin

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)

Recommendations

• Graph reduction in the construction of minimal clique cover
• Assignment-minimum clique coverings
• Clique covering and clique partition in generalizations of line graphs
• scientific article; zbMATH DE number 4068924
• scientific article; zbMATH DE number 1545697

Cited in

(5)

• Neighborhood search heuristics for the uncapacitated facility location problem
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• scientific article; zbMATH DE number 5914909 (Why is no real title available?)
• Assignment-minimum clique coverings
• Evolutionary approach to obtain graph covering by densely connected subgraphs

This page was built for publication: Methods of finding all minimum coverings of a graph by cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903945)