medil.ecc_algorithms.find_clique_min_cover
- medil.ecc_algorithms.find_clique_min_cover(graph, verbose=False)[source]
Returns the clique-minimum edge clique cover.
- Parameters:
graph (np.array) – Adjacency matrix for undirected graph.
verbose (bool, optional) – Wether or not to print verbose output.
- Returns:
the_cover – Biadjacency matrix representing edge clique cover.
- Return type:
np.array
See also
graph.UndirectedDependenceGraph
Defines auxilliary data structure and reduction rules used by this algorithm.
Notes
This is an implementation of the algorithm described in [GGfN09].