On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
Dominique BarthSylvie CorteelAlain DeniseDanièle GardyMario Valencia-PabonPublished in: LATIN (2000)
Keyphrases
- extended abstract
- disjoint paths
- decision trees
- approximation algorithms
- computational cost
- computational complexity
- worst case
- neural network
- data sets
- decision problems
- ad hoc networks
- bayesian networks
- image segmentation
- probability distribution
- routing protocol
- learning algorithm
- machine learning
- network topology
- space complexity
- tree models