Pages that link to "Item:Q2453164"
From MaRDI portal
The following pages link to Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164):
Displaying 9 items.
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph (Q526869) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
