An improved upper bound and algorithm for clique covers

DOI10.1016/J.JDA.2018.03.002MaRDI QIDQ1748206zbMATH OpenOpenAlexFDO

Authors Ryan McIntyre, Michael Soltys

Publication date 9 May 2018

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2018.03.002

zbMATH Keywords

indeterminatesclique coversMantel's theoremLovász bound

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Constructing an indeterminate string from its associated graph
• Data reduction, exact, and heuristic algorithms for clique cover
• A new upper bound for the clique cover number with applications
• scientific article; zbMATH DE number 1545697
• Data reduction and exact algorithms for clique cover

Cites work

• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• Applications of edge coverings by cliques
• Constructing an indeterminate string from its associated graph
• Indeterminate strings, prefix arrays \& undirected graphs
• The Representation of a Graph by Set Intersections

Cited in

(6)

• Clique Covering of Graphs IV. Algorithms
• scientific article; zbMATH DE number 7192822 (Why is no real title available?)
• Data reduction and exact algorithms for clique cover
• Principles and Practice of Constraint Programming – CP 2004
• Constructing an indeterminate string from its associated graph
• Clique Cover and Graph Separation

This page was built for publication: An improved upper bound and algorithm for clique covers

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