Pages that link to "Item:Q1736530"

The following pages link to Exact algorithms for maximum clique: a computational study (Q1736530):

Displaying 20 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)
• 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)
• Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
• Editorial: Special issue on graph algorithms (Q1736576) (← links)
• Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
• Dynamic node packing (Q2097666) (← links)
• An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
• Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
• Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
• A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← 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)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)