The Complexity of Packing Edge-Disjoint Paths.

Jan Dreier Janosch Fuchs Tim A. Hartmann Philipp Kuinke Peter Rossmanith Bjoern Tauer Hung-Lung Wang

Published in: CoRR (2019)

Keyphrases

disjoint paths
approximation algorithms
worst case
directed graph
computational complexity
undirected graph
neural network
np hard
information systems
case study
search algorithm
probabilistic model