k-pairwise disjoint paths routing in perfect hierarchical hypercubes.
Antoine BossardKeiichi KanekoPublished in: J. Supercomput. (2014)
Keyphrases
- disjoint paths
- pairwise
- multi class
- approximation algorithms
- similarity measure
- directed graph
- undirected graph
- higher order
- markov random field
- loss function
- hierarchical clustering
- routing problem
- network topology
- routing protocol
- hierarchical structure
- hierarchical model
- wireless ad hoc networks
- pairwise interactions
- end to end
- similarity function
- ad hoc networks
- coarse to fine
- high order
- shortest path
- mobile ad hoc networks
- inter domain
- data structure