Pages that link to "Item:Q5710802"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710802):
Displaying 12 items.
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- On spectrum sharing games (Q2377140) (← links)
- The number of disk graphs (Q2509768) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
- Maximum independent and disjoint coverage (Q5918798) (← links)
