Pages that link to "Item:Q1652309"
From MaRDI portal
The following pages link to On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309):
Displaying 4 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)