Pages that link to "Item:Q1849924"
From MaRDI portal
The following pages link to Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set (Q1849924):
Displaying 8 items.
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- Minimum degree algorithms for stability number (Q1414595) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- (Q3980035) (← links)