Graph reduction in the construction of minimal clique cover

DOI10.4213/MVK63zbMATH Open1475.05152OpenAlexW2789394248MaRDI QIDQ4959050FDOQ4959050

Authors: P. V. Roldugin 

Publication date: 15 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk63

Recommendations

• scientific article; zbMATH DE number 7310192
• Data reduction and exact algorithms for clique cover
• Data reduction, exact, and heuristic algorithms for clique cover
• scientific article; zbMATH DE number 1545697
• Assignment-minimum clique coverings

zbMATH Keywords

cliquesclasses of graphsgraph coverings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• A simple lower bound on edge coverings by cliques
• Data reduction, exact, and heuristic algorithms for clique cover

Cited In (9)

• Title not available (Why is that?)
• Data reduction and exact algorithms for clique cover
• Methods of finding all minimum coverings of a graph by cliques
• Title not available (Why is that?)
• Assignment-minimum clique coverings
• Reducing graph coloring to clique search
• Data reduction, exact, and heuristic algorithms for clique cover
• The inductive graph dimension from the minimum edge clique cover
• Extremal and asymptotic properties of irreducible coverings of graphs by cliques

This page was built for publication: Graph reduction in the construction of minimal clique cover

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