The k edge-disjoint 3-hop-constrained paths polytope.

Fatiha Bendali I. Diarrassouba Ali Ridha Mahjoub Jean Mailfert

Published in: Discret. Optim. (2010)

Keyphrases

edge disjoint
spanning tree
total length
convex hull
shortest path
lattice points
optimal path
stable set
neural network
case study
data points
directed graph
minimum cost
path finding
running times