Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length.

Brahim Neggazi Mohammed Haddad Hamamache Kheddouci

Published in: TADDS (2012)

Keyphrases

fixed length
graph structure
variable length
computational complexity
objective function
undirected graph
graph based algorithm
np hard
dynamic programming
worst case
weighted graph
disjoint paths
similarity measure
lower bound
random variables
approximation algorithms