A New Approach for Solving the Maximum Clique Problem

DOI10.1007/11775096_26zbMATH Open1137.68503OpenAlexW1529840995MaRDI QIDQ5434406

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

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

Related Items (7)

A New Algorithm for Computing the Maximal Closure of a Graph ⋮ Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary) ⋮ A new trust region technique for the maximum weight clique problem ⋮ Title not available (Why is that?) ⋮ A study of ACO capabilities for solving the maximum clique problem ⋮ Title not available (Why is that?) ⋮ A clique search problem and its application to machine scheduling

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An exact algorithm for the maximum clique problem 👍 👎
• A fast algorithm for the maximum clique problem 👍 👎
• On solving the maximum clique problem 👍 👎
• A new algorithm for the maximum-weight clique problem 👍 👎
• Algorithm Theory - SWAT 2004 👍 👎
• A branch and bound algorithm for the maximum clique problem 👍 👎
• A branch and bound algorithm for 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)