Pages that link to "Item:Q5056088"
From MaRDI portal
The following pages link to Approximating maximum independent sets by excluding subgraphs (Q5056088):
Displaying 8 items.
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Approximating Maximum Clique by Removing Subgraphs (Q4652632) (← links)
- Hard graphs for randomized subgraph exclusion algorithms (Q5054768) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- MNP: A class of NP optimization problems (Q6085753) (← links)