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):
Displaying 45 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)
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← 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)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← 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)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← 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)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Combining Heuristics for Configuration Problems Using Answer Set Programming (Q3449221) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- (Q5002730) (← 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)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← 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)