Pages that link to "Item:Q5315241"
From MaRDI portal
The following pages link to Structural Information and Communication Complexity (Q5315241):
Displaying 13 items.
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- On approximation properties of the independent set problem for low degree graphs (Q1281930) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Approximation algorithms for independent sets in map graphs (Q2765954) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms (Q4608072) (← links)
- (Q5263782) (← links)
- (Q5875555) (← links)
- Greedy approximations of independent sets in low degree graphs (Q6487957) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
