Pages that link to "Item:Q777274"
From MaRDI portal
The following pages link to The maximum distance-\(d\) independent set problem on unit disk graphs (Q777274):
Displaying 6 items.
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs (Q887860) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs (Q4815769) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)