On the complexity of vertex-disjoint length-restricted path problems (Q1762664): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00037-003-0179-6 / 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.1007/s00037-003-0179-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999679195 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00037-003-0179-6 / rank | |||
Normal rank | |||
Latest revision as of 09:13, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of vertex-disjoint length-restricted path problems |
scientific article |
Statements
On the complexity of vertex-disjoint length-restricted path problems (English)
0 references
11 February 2005
0 references
Disjoint paths
0 references
length-restricted paths
0 references
approximability
0 references
