NP-completeness of some edge-disjoint paths problems
type: Item
instance of: scholarly article
title: NP-completeness of some edge-disjoint paths problems
zbMATH Open document ID: 0831.68078
DOI: 10.1016/0166-218X(93)E0177-Z
author: Jens Vygen
published in: Discrete Applied Mathematics
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 790504
zbMATH Keywords: NP-completeness
zbMATH Keywords: edge-disjoint paths problem
MaRDI profile type: Publication
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q3972951
cites work: Weak Three-Linking in Eulerian Dgraphs
cites work: Half-integral five-terminus flows
cites work: A Minimax Theorem for Directed Graphs
cites work: On the complexity of the disjoint paths problem
cites work: Multicommodity flows in planar graphs
cites work: Feasibility of Two Commodity Network Flows
description: scientific article; zbMATH DE number 790504