scientific article; zbMATH DE number 1560331

MaRDI QIDQ4527181zbMATH OpenFDO

Authors Earl R. Barnes

Publication date 26 April 2001

zbMATH Keywords

largest clique in a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding a Maximum Clique in an Arbitrary Graph
• An algorithm for finding a maximum clique in a graph
• A METHOD FOR COMPUTING UPPER BOUNDS ON THE SIZE OF A MAXIMUM CLIQUE
• scientific article; zbMATH DE number 2040957
• A fast algorithm for the maximum clique problem

Cited in

(7)

• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
• Exact bounds on the order of the maximum clique of a graph.
• Estimating clique size by coloring the nodes of auxiliary graphs
• A METHOD FOR COMPUTING UPPER BOUNDS ON THE SIZE OF A MAXIMUM CLIQUE
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• A sequential elimination algorithm for computing bounds on the clique number of a graph

This page was built for publication:

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