Pages that link to "Item:Q342100"

The following pages link to Infra-chromatic bound for exact maximum clique search (Q342100):

Displaying 18 items.

• 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)
• On comparing algorithms for the maximum clique problem (Q1671301) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• A new upper bound for the maximum weight clique problem (Q1754725) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← 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)
• Reducing hypergraph coloring to clique search (Q2422750) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← 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)
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← 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)