Pages that link to "Item:Q868636"
From MaRDI portal
The following pages link to An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636):
Displayed 21 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- Discrete Optimization with Decision Diagrams (Q2806864) (← links)
- Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111) (← links)
- Optimization Bounds from Binary Decision Diagrams (Q2962554) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Combining Heuristics for Configuration Problems Using Answer Set Programming (Q3449221) (← links)