Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
type: Item
instance of: scholarly article
title: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
zbMATH Open document ID: 1462.05338
author: Satoshi Shimizu
author: Kazuaki Yamaguchi
author: Toshiki Saitoh
author: Sumio Masuda
published in: Discrete Applied Mathematics
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7355973
zbMATH Keywords: maximum weight clique
zbMATH Keywords: exact algorithm
zbMATH Keywords: branch-and-bound
zbMATH Keywords: upper bound calculation
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: j.dam.2017.01.026
OpenAlex ID: W2593997691
cites work: A fast algorithm for the maximum weight clique problem
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Improvements to MCS algorithm for the maximum clique problem
cites work: Error-correcting codes over an alphabet of four elements
cites work: An exact algorithm for the maximum clique problem
cites work: Q4198056
cites work: On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
cites work: An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
cites work: An algorithm for finding a maximum weighted independent set in an arbitrary graph
cites work: A branch and bound algorithm for the maximum clique problem
cites work: The maximum clique problem
cites work: Q4547547
cites work: A fast algorithm for the maximum clique problem
cites work: A tutorial on branch and cut algorithms for the maximum stable set problem
cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: Q4452109
cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
cites work: An algorithm for finding a maximum clique in a graph
DOI: 10.1016/J.DAM.2017.01.026
Recommended article: A fast algorithm for the maximum weight clique problem
Recommended article: A maximum edge-weight clique extraction algorithm based on branch-and-bound
Recommended article: A new branch-and-bound algorithm for the maximum weighted clique problem
Recommended article: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Recommended article: A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Recommended article: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Recommended article: A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
Recommended article: Q4411385
Recommended article: Q4452109
Recommended article: Speeding up branch and bound algorithms for solving the maximum clique problem
description: scientific article; zbMATH DE number 7355973