Pages that link to "Item:Q5284217"
From MaRDI portal
The following pages link to Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem (Q5284217):
Displaying 9 items.
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082) (← links)
- Generating hard and diverse test sets for NP-hard graph problems (Q1805463) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
- (Q4228449) (← links)