The complexity of finding maximum disjoint paths with length constraints (Q4741713)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3795372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding maximum disjoint paths with length constraints |
scientific article; zbMATH DE number 3795372 |
Statements
The complexity of finding maximum disjoint paths with length constraints (English)
0 references
1982
0 references
undirected graph
0 references
disjoint paths
0 references
NP-completeness
0 references
