Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
From MaRDI portal
Publication:1913697
Recommendations
- A fast algorithm for the maximum weight clique problem
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- New lower bounds on the weighted chromatic number of a graph
- A new algorithm for the maximum-weight clique problem
- Solving the minimum-weighted coloring problem
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3404264 (Why is no real title available?)
- A branch and bound algorithm for the maximum clique problem
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- A graph coloring algorithm for large scheduling problems
- An exact algorithm for the maximum clique problem
- An exact algorithm for the maximum stable set problem
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
- Finding a Maximum Clique in an Arbitrary Graph
- Finding maximum cliques in arbitrary and in special graphs
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- New methods to color the vertices of a graph
Cited in
(23)- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- An algorithm for finding a maximum clique in a graph
- Infra-chromatic bound for exact maximum clique search
- Estimating clique size by coloring the nodes of auxiliary graphs
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Detecting robust cliques in graphs subject to uncertain edge failures
- Solving the minimum-weighted coloring problem
- An exact algorithm for the maximum probabilistic clique problem
- Iterative coloring extension of a maximum clique
- On the minimum number of logical clauses inferred from examples
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Efficient pattern matching on big uncertain graphs
- A fast algorithm for the maximum clique problem
- The maximum clique problem
- Solving hard set covering problems
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- New lower bounds on the weighted chromatic number of a graph
- Co-2-plex vertex partitions
- Reducing graph coloring to clique search
- scientific article; zbMATH DE number 7407404 (Why is no real title available?)
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
This page was built for publication: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913697)
