Pages that link to "Item:Q1414595"
From MaRDI portal
The following pages link to Minimum degree algorithms for stability number (Q1414595):
Displaying 9 items.
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
- Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set (Q1849924) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- Minimum number of non-zero-entries in a stable matrix exhibiting Turing instability (Q2676231) (← links)
- On vertex orderings and the stability number in triangle-free graphs (Q5937606) (← links)