Pages that link to "Item:Q2630214"
From MaRDI portal
The following pages link to A review on algorithms for maximum clique problems (Q2630214):
Displaying 27 items.
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- Correlation between the continuous-time quantum walk and cliques in graphs and its application (Q5003363) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← 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)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks (Q5157180) (← links)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)
- A post-quantum associative memory (Q6063372) (← links)
- The exam location problem: mathematical formulations and variants (Q6065634) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks (Q6098526) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- Maximum independent sets and supervised learning (Q6151016) (← links)
- A new binary (17,4,5) constant weight code (Q6159452) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
- Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)
- Exact and heuristic solution approaches for the generalized independent set problem (Q6551177) (← links)
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search (Q6564766) (← links)