Pages that link to "Item:Q3960887"
From MaRDI portal
The following pages link to Determining the number of internal stability of a graph (Q3960887):
Displayed 14 items.
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- The maximum clique problem (Q1318271) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- An exact algorithm for the pallet loading problem (Q1820701) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- An algorithm for the maximum internally stable set in a weighted graph (Q3968462) (← links)
- A global optimization approach for solving the maximum clique problem (Q4009762) (← links)
- Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
- GEODETIC GAMES FOR GRAPHS (Q4724436) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)