Pages that link to "Item:Q3404446"

The following pages link to A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q3404446):

Displaying 40 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)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• On risk-averse maximum weighted subgraph problems (Q405680) (← links)
• A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
• Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
• Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
• SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← 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)
• Large-scale frequent stem pattern mining in RNA families (Q1714283) (← 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 nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← 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)
• 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)
• Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← 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)
• Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
• On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
• Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111) (← 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)
• Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← 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)
• 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)