Pages that link to "Item:Q709206"

The following pages link to An exact bit-parallel algorithm for the maximum clique problem (Q709206):

Displaying 50 items.

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Breakout local search for maximum clique problems (Q339563) (← links)
• Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
• A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
• Social structure optimization in team formation (Q342472) (← links)
• On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) (← links)
• A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← 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)
• 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)
• 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 new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
• A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← 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)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
• A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
• An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
• Recognition of split-graphic sequences (Q2254547) (← 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)
• Reducing hypergraph coloring to clique search (Q2422750) (← 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)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
• On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← 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)
• <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
• Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← 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)
• Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
• An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
• A post-quantum associative memory (Q6063372) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
• A differentiable approach to the maximum independent set problem using dataless neural networks (Q6488722) (← links)
• Differentiable discrete optimization using dataless neural networks (Q6606216) (← links)