Pages that link to "Item:Q2889031"
From MaRDI portal
The following pages link to Geometric algorithms for sensor networks (Q2889031):
Displaying 21 items.
- Virtual coordinates in hyperbolic space based on Ricci flow for WLANs (Q279961) (← links)
- On the planarization of wireless sensor networks (Q548669) (← links)
- Editorial for algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities (Q742406) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Geometric spanners with applications in wireless networks (Q868107) (← links)
- A scalable sensor network using a polar coordinate system (Q971128) (← links)
- Two optimization problems for unit disks (Q1615636) (← links)
- Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
- Heuristic algorithm for finding boundary cycles in location-free low density wireless sensor networks (Q1957827) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Similarity-based analysis for large networks of ultra-low resolution sensors (Q2498689) (← links)
- Localization and scheduling protocols for actor-centric sensor networks (Q2894248) (← links)
- Geometric structure of the joint N-voM distribution manifold and its applications to sensor networks (Q3133972) (← links)
- Formation of a geometric pattern with a mobile wireless sensor network (Q3367046) (← links)
- Centdian Computation for Sensor Networks (Q3569075) (← links)
- A Computational Geometry Framework for Efficient Network Localization (Q4566705) (← links)
- Somek-hop based graph metrics and noderanking in wireless sensor networks (Q5217948) (← links)
- Distributed Graph Layout for Sensor Networks (Q5301375) (← links)
- Graph Drawing (Q5711613) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
