Pages that link to "Item:Q1414578"
From MaRDI portal
The following pages link to Powers of geometric intersection graphs and dispersion algorithms (Q1414578):
Displaying 8 items.
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- (Q5009468) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
