1 paper
Anthony Hevia, Benjamin Kallus, Summer McClintic +3
The edge clique cover (ECC) problem -- where the goal is to find a minimum cardinality set of cliques that cover all the edges of a graph -- is a classic NP-hard problem that has r…