Редукция графа при поиске реберного покрытия минимальным числом клик

DOI10.4213/mvk63zbMath1475.05152OpenAlexW2789394248MaRDI QIDQ4959050

Pavel 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

zbMATH Keywords

cliquesgraph coveringsclasses of graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A simple lower bound on edge coverings by cliques
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover