Output-sensitive enumeration of potential maximal cliques in polynomial space

DOI10.1007/978-3-031-63021-7_29MaRDI QIDQ7021079zbMATH OpenFDO

Authors Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_29

zbMATH Keywords

graph enumerationpotential maximal cliques

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
• Efficiently enumerating minimal triangulations
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• scientific article; zbMATH DE number 1305094 (Why is no real title available?)
• scientific article; zbMATH DE number 7764113 (Why is no real title available?)
• Independent set in P₅-free graphs in polynomial time
• Large Induced Subgraphs via Triangulations and CMSO
• Listing all potential maximal cliques of a graph
• On the maximum weight independent set problem in graphs without induced cycles of length at least five
• Polynomial delay algorithm for minimal chordal completions
• Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs
• Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• Treewidth and minimum fill-in: Grouping the minimal separators
• Treewidth Computation and Extremal Combinatorics

This page was built for publication: Output-sensitive enumeration of potential maximal cliques in polynomial space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021079)