Optimal partial clique edge covering guided by potential energy minimization

DOI10.1007/S11590-019-01469-YMaRDI QIDQ2329666zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 18 October 2019

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-019-01469-y

zbMATH Keywords

clique edge coveringinduced graph decompositionpotential energyreaction network

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1545697
• scientific article; zbMATH DE number 1286502
• Data reduction, exact, and heuristic algorithms for clique cover
• Assignment-minimum clique coverings
• Approximation Algorithms for the k-Clique Covering Problem

Cites work

• Calculating approximation guarantees for partial set cover of pairs
• Covering designs on 13 blocks revisisted
• Generalized covering designs and clique coverings
• scientific article; zbMATH DE number 3695222 (Why is no real title available?)
• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Induced decompositions of graphs
• Maximal consistent families of triples
• New constructions for covering designs
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Potential energy principles in networked systems and their connections to optimization problems on graphs

Cited in

(2)

• Finding optimal triangulations parameterized by edge clique cover
• scientific article; zbMATH DE number 7764113 (Why is no real title available?)

This page was built for publication: Optimal partial clique edge covering guided by potential energy minimization

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