Pages that link to "Item:Q786833"
From MaRDI portal
The following pages link to A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833):
Displayed 5 items.
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- The maximum clique problem (Q1318271) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)