2 papers
cs.DS2026
Output-linear time enumeration of potential maximal cliques
Pierre Bergé, Vincent Limouzy, Nicolas Schivre
First defined by Bouchitté and Todinca, Potential Maximal Cliques (PMC) are a well studied notion in graph theory due to its numerous applications. The PMCs of an undirected graph…
cs.DM2026
The disjoint separators problem in graphs
Thomas Delépine, Florian Galliot, Yannick Mogge +2
We study the disjoint separators problem in graphs, an analogue of the famous disjoint paths problem. Given a graph and four pairwise disjoint subsets of vertices , ,…