Pages that link to "Item:Q4698692"
From MaRDI portal
The following pages link to Improved approximations of independent sets in bounded-degree graphs via subgraph removal (Q4698692):
Displaying 16 items.
- Independent sets in graphs (Q501998) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Approximating Maximum Clique by Removing Subgraphs (Q4652632) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- (Q5075740) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
- Greedy approximations of independent sets in low degree graphs (Q6487957) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
