The following pages link to (Q4714131):
Displayed 10 items.
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Solving maximum independent set by asynchronous distributed hopfield-type neural networks (Q3431447) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)