Pages that link to "Item:Q1310979"
From MaRDI portal
The following pages link to Test case generators and computational results for the maximum clique problem (Q1310979):
Displaying 23 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- A coloring problem on the \(n\)-cube (Q1570845) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- Monotonic optimization based decoding for linear codes (Q1941018) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- Estimating the fractional chromatic number of a graph (Q2236364) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Error-tolerance pooling designs based on Johnson graphs (Q2448188) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
- (Q4228449) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem (Q5284217) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- On the chromatic number of graphs (Q5942344) (← links)