Landmark routing for large graphs in fixed-memory environments.
Newton CampbellMichael J. LaszloSumitra MukherjeePublished in: HPEC (2016)
Keyphrases
- dynamic environments
- ad hoc networks
- graph matching
- real world
- memory space
- graph theoretic
- routing problem
- image registration
- graph theory
- routing algorithm
- memory requirements
- main memory
- directed graph
- memory usage
- computing power
- limited memory
- memory size
- associative memory
- computing environments
- network topology
- graph model
- mobile ad hoc networks
- database management systems
- graph search
- disk resident