Pages that link to "Item:Q1671301"
From MaRDI portal
The following pages link to On comparing algorithms for the maximum clique problem (Q1671301):
Displaying 7 items.
- Evaluating the effects of the clique selection in exact graph colouring algorithms (Q659453) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem (Q5284217) (← links)