Local Routing in Sparse and Lightweight Geometric Graphs.
Vikrant AshvinkumarJoachim GudmundssonChristos LevcopoulosBengt J. NilssonAndré van RenssenPublished in: CoRR (2019)
Keyphrases
- lightweight
- graph theoretical
- high dimensional
- graph matching
- gaussian graphical models
- directed acyclic
- communication infrastructure
- graph theory
- routing algorithm
- directed graph
- sparse representation
- geometric constraints
- graph structure
- object model
- network topology
- geometric structure
- random graphs
- handheld devices
- dos attacks
- ad hoc networks
- development environments
- end to end
- reeb graph