Yet another algorithm for maximal clique enumeration problem

DOI10.1142/S1793830925500703MaRDI QIDQ7303544zbMATH OpenFDO

Authors Zine El Abidine Bouneb

Publication date 24 July 2026

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830925500703

Mathematics Subject Classification ID

Partitions of sets (05A18) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics of partially ordered sets (06A07) General topics in the theory of algorithms (68W01)

Cites work

• A strong-connectivity algorithm and its applications in data flow analysis
• Algorithm 457: finding all cliques of an undirected graph
• Chain reduction for binary and zero-suppressed decision diagrams
• Combinatorics of set partitions
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
• Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring
• On the Complexity of Timetable and Multicommodity Flow Problems
• The Complexity of Enumeration and Reliability Problems
• The complexity of theorem-proving procedures
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
• The worst-case time complexity for generating all maximal cliques and computational experiments

This page was built for publication: Yet another algorithm for maximal clique enumeration problem

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