Pages that link to "Item:Q342165"
From MaRDI portal
The following pages link to A new exact maximum clique algorithm for large and massive sparse graphs (Q342165):
Displaying 13 items.
- The maximum clique interdiction problem (Q1735171) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)