A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
From MaRDI portal
Publication:5154765
DOI10.1613/JAIR.1.12327OpenAlexW3199242384WikidataQ131020221 ScholiaQ131020221MaRDI QIDQ5154765FDOQ5154765
Authors: Shaowei Cai, Yiyuan Wang, Darren Strash, Jinkun 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
Recommendations
- A new exact maximum clique algorithm for large and massive sparse graphs
- A fast algorithm for the maximum weight clique problem
- Fast algorithms for the maximum clique problem on massive sparse graphs
- Fast maximal cliques enumeration in sparse graphs
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- A new algorithm for the maximum-weight clique problem
- scientific article; zbMATH DE number 1786225
- Clustered maximum weight clique problem: algorithms and empirical analysis
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- A parallel maximum clique algorithm for large and massive sparse graphs
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Reducibility among combinatorial problems
- Linear degree extractors and the inapproximability of max clique and chromatic number
- A hybrid heuristic for the maximum clique problem
- Title not available (Why is that?)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Approximating the maximum vertex/edge weighted clique using local search
- Multi-neighborhood tabu search for the maximum weight clique problem
- A new trust region technique for the maximum weight clique problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Title not available (Why is that?)
- Phased local search for the maximum clique problem
- Breakout local search for maximum clique problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved bit parallel exact maximum clique algorithm
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- A new exact maximum clique algorithm for large and massive sparse graphs
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- A complementary pivoting approach to the maximum weight clique problem
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Graph domination, coloring and cliques in telecommunications
- Max-coloring of vertex-weighted graphs
- 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
- Towards faster local search for minimum weight vertex cover on massive graphs
- Solving maximum weight clique using maximum satisfiability reasoning
- Exactly solving the maximum weight independent set problem on large real-world graphs
Cited In (10)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- A parllel algorithm for finding a maximum weight clique of an interval graph
- Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
- Fast algorithms for the maximum clique problem on massive sparse graphs
Uses Software
This page was built for publication: A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154765)
