A new algorithm for the maximum-weight clique problem
From MaRDI portal
Recommendations
Cited in
(35)- HEWN: A polynomial algorithm for CLIQUE problem
- A fast algorithm for the maximum weight clique problem
- Clustered maximum weight clique problem: algorithms and empirical analysis
- PUSH: A generalized operator for the maximum vertex weight clique problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- New algorithms for the weighted maximum cut problem on graphs
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Finding cliques of maximum weight on a generalization of permutation graphs
- 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
- The maximum ratio clique problem
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- A new trust region technique for the maximum weight clique problem
- A complementary pivoting approach to the maximum weight clique problem
- An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
- Safe lower bounds for graph coloring
- A New Algorithm for Computing the Maximal Closure of a Graph
- A new algorithm for the maximum clique problem
- Real-time systems: incomplete solution approach for the maximum-weighted clique problem
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
- On the Maximum Weight Clique Problem
- Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
- scientific article; zbMATH DE number 1560332 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- Maximum weight archipelago subgraph problem
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- A New Approach for Solving the Maximum Clique Problem
- A parllel algorithm for finding a maximum weight clique of an interval graph
- Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits.
- On the size of integer programs with bounded non-vanishing subdeterminants
- The combinatorics of pivoting for the maximum weight clique.
- An exact algorithm for the maximum clique problem
This page was built for publication: A new algorithm for the maximum-weight clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741359)
