On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.
Marcus AutenriethHannes FreyPublished in: NetSys (2013)
Keyphrases
- greedy algorithm
- ad hoc networks
- graph theory
- routing algorithm
- multi dimensional
- internet protocol
- random graphs
- graph theoretic
- graph matching
- internet users
- power law
- routing protocol
- web technologies
- network topology
- search space
- euclidean space
- low dimensional
- directed graph
- end to end
- shortest path
- dynamic programming
- dimensionality reduction
- graph structure
- graph representation
- high dimensional
- vector space
- search algorithm
- bounded treewidth
- feature selection