Pages that link to "Item:Q2175041"
From MaRDI portal
The following pages link to An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041):
Displaying 6 items.
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs (Q1652526) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- (Q3623999) (← links)