The complexity of finding maximum disjoint paths with length constraints (Q4741713): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Yossi Shiloach / rank | |||
| Property / author | |||
| Property / author: Yossi Shiloach / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230120306 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000733920 / rank | |||
Normal rank | |||
Latest revision as of 22:36, 19 March 2024
scientific article; zbMATH DE number 3795372
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
