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: IPEC (2019)

Keyphrases

disjoint paths
approximation algorithms
directed graph
worst case
undirected graph
special case
np hard
graphical models
neural network
space complexity
databases
computational cost
denoising
database
binary images
complex networks
computational complexity