Pages that link to "Item:Q1736587"
From MaRDI portal
The following pages link to Multi-threading a state-of-the-art maximum clique algorithm (Q1736587):
Displaying 9 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)