A New Approach for Solving the Maximum Clique Problem

DOI10.1007/11775096_26MaRDI QIDQ5434406zbMATH OpenOpenAlexFDO

Authors Peter J. Taillon

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_26

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A new algorithm for the maximum clique problem
• A new algorithm for the maximum-weight clique problem
• scientific article; zbMATH DE number 1786225
• On solving the maximum clique problem
• An exact algorithm for the maximum clique problem
• Algorithm Theory - SWAT 2004
• A fast algorithm for the maximum clique problem
• A branch and bound algorithm for the maximum clique problem
• A branch and bound algorithm for the maximum clique problem

Cited in

(9)

• Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)
• A clique search problem and its application to machine scheduling
• Subgraph extraction and metaheuristics for the maximum clique problem
• A new trust region technique for the maximum weight clique problem
• A study of ACO capabilities for solving the maximum clique problem
• A New Algorithm for Computing the Maximal Closure of a Graph
• scientific article; zbMATH DE number 1560332 (Why is no real title available?)
• scientific article; zbMATH DE number 956848 (Why is no real title available?)
• Using constraint programming to solve the maximum clique problem

This page was built for publication: A New Approach for Solving the Maximum Clique Problem

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