Pages that link to "Item:Q4009762"
From MaRDI portal
The following pages link to A global optimization approach for solving the maximum clique problem (Q4009762):
Displayed 11 items.
- The maximum clique problem (Q1318271) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- Genetic algorithmic approach to find the maximum weight independent set of a graph (Q2471331) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning (Q4816960) (← links)