Local Routing in Sparse and Lightweight Geometric Graphs.
Vikrant AshvinkumarJoachim GudmundssonChristos LevcopoulosBengt J. NilssonAndré van RenssenPublished in: Algorithmica (2022)
Keyphrases
- lightweight
- graph theoretical
- gaussian graphical models
- routing problem
- sparse representation
- directed graph
- directed acyclic
- routing algorithm
- high dimensional
- topological information
- graph matching
- graph theory
- geometric structure
- communication infrastructure
- dos attacks
- ad hoc networks
- wireless sensor networks
- handheld devices
- rfid tags
- geometric constraints