Pages that link to "Item:Q1941191"
From MaRDI portal
The following pages link to An improved bit parallel exact maximum clique algorithm (Q1941191):
Displaying 22 items.
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← 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 new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← 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)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← 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)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)