A new algorithm for the maximum clique problem

MaRDI QIDQ3502019zbMATH OpenFDO

Authors Xiao Feng Jia, Tinghua Guo, Xiaoxing Xu

Publication date 3 June 2008

zbMATH Keywords

average degreeenumerative algorithmmaximum cliquerandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A new algorithm for the maximum-weight clique problem
• An algorithm for finding a maximum clique in a graph
• A fast algorithm for the maximum clique problem
• An improved branch and bound algorithm for the maximum clique problem
• An exact algorithm for the maximum clique problem

Cited in

(14)

• HEWN: A polynomial algorithm for CLIQUE problem
• Exact algorithms for maximum clique: a computational study
• Maximum clique exhaustive search in circulant \(k\)-hypergraphs
• A study of ACO capabilities for solving the maximum clique problem
• An extension of the Newman-Janis algorithm
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
• A New Algorithm for Computing the Maximal Closure of a Graph
• On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
• An exact algorithm for the maximum probabilistic clique problem
• scientific article; zbMATH DE number 1560332 (Why is no real title available?)
• A labeling order scheme for the maximum clique problem
• A New Approach for Solving the Maximum Clique Problem
• Graph-Theoretic Concepts in Computer Science
• An algorithm for reporting maximal \(c\)-cliques

This page was built for publication: A new algorithm for the maximum clique problem

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