A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
From MaRDI portal
Publication:5154765
DOI10.1613/jair.1.12327OpenAlexW3199242384MaRDI QIDQ5154765
Shaowei Cai, Yiyuan Wang, Darren Strash, Jin Kun Lin
Publication date: 5 October 2021
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.12327
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Breakout local search for maximum clique problems
- A new exact maximum clique algorithm for large and massive sparse graphs
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Approximating the maximum vertex/edge weighted clique using local search
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- A new upper bound for the maximum weight clique problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- An improved bit parallel exact maximum clique algorithm
- A new branch-and-bound algorithm for the maximum weighted clique problem
- Towards faster local search for minimum weight vertex cover on massive graphs
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Phased local search for the maximum clique problem
- A new trust region technique for the maximum weight clique problem
- A hybrid heuristic for the maximum clique problem
- A Complementary Pivoting Approach to the Maximum Weight Clique Problem
- Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- Reducibility among Combinatorial Problems
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
- Max-coloring of vertex-weighted graphs
