Pages that link to "Item:Q3095042"
From MaRDI portal
The following pages link to A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042):
Displaying 8 items.
- Discrete harmonic functions on infinite penny graphs (Q2042257) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- On the Hardness of Energy Minimisation for Crystal Structure Prediction (Q3297788) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- On the Hardness of Energy Minimisation for Crystal Structure Prediction* (Q5862342) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Harmonic functions of polynomial growth on infinite penny graphs (Q6133811) (← links)
