The following pages link to (Q4411385):
Displaying 20 items.
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
