DisjointCliqueCover.jl
Description
This package DisjointCliqueCover, written in the Julia language, implements a method to estimate a minimal edgedisjoint edge clique cover (EECC) of a graph, according to the heuristic presented in Burgio et al. [1]. A minimal edge clique cover is a minimal set of cliques able to cover the entire set of edges in the graph. In a EECC, the cliques are required to be all edgedisjoint, i.e., they can have no more than one vertex in common.
A graph can admit multiple minimal edge clique covers and finding one of them is known to be a NPcomplete problem. Therefore, approximate heuristics are needed to estimate it in large graphs.
The notion of EECC is introduced in [1] as a basis to define the Microscopic Epidemic Clique Equations (MECLE) model. This is a discretetime markovian model describing complex contagion processes on higherorder networks, represented as hypergraphs and, specifically, as simplicial complexes. The model builds upon the cliques in the underlying graph of a considered higherorder network. As shown in [1], in order to account for the higherorder dynamical correlations among the states of the nodes in those cliques, the latter are required to be edjedisjoint. This leads to the search for the minimal EECC of the underlying graph, hence to the respective heuristic whose source code is here provided.
References
 Giulio Burgio, Alex Arenas, Sergio Gómez and Joan T. Matamalas: Network clique cover approximation to analyze complex contagions through group interactions, Comms. Phys. 4, 111 (2021) (doi)
Authors

Giulio Burgio (Universitat Rovira i Virgili, Tarragona, Spain)

Alex Arenas (Universitat Rovira i Virgili, Tarragona, Spain)

Sergio Gómez (Universitat Rovira i Virgili, Tarragona, Spain)

Joan T. Matamalas (Harvard Medical School & Brigham and Women's Hospital, Boston, USA)
Documentation
The full documentation of DisjointCliqueCover.jl can be found here