Pages that link to "Item:Q4632188"
From MaRDI portal
The following pages link to A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188):
Displaying 5 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900316) (← links)