An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem

DOI10.1613/jair.4953zbMath1352.05174OpenAlexW2321167683MaRDI QIDQ2800956

Ke Xu, Chu-Min Li, Zhiwen Fang

Publication date: 19 April 2016

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4953

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (8)

Clustered maximum weight clique problem: algorithms and empirical analysis ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ Parallelization of a branch-and-bound algorithm for the maximum weight clique problem ⋮ PUSH: A generalized operator for the maximum vertex weight clique problem ⋮ A new upper bound for the maximum weight clique problem ⋮ A new branch-and-bound algorithm for the maximum weighted clique problem ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound

This page was built for publication: An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem