Near-Optimal Algorithms for Maximal Clique Enumeration in Structurally Sparse Graphs

Jianfeng Hou, Hongbin Zhao

We study the exact enumeration of maximal cliques in graph classes defined by excluded clique minors and excluded clique immersions. For n-vertex K_t-minor-free graphs, we give an…