Finding disjoint paths with different path-costs: Complexity and algorithms (Q4022731): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230220705 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997556033 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4845370 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. XIII: The disjoint paths problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 2-linked graphs / rank | |||
Normal rank | |||
Revision as of 13:14, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding disjoint paths with different path-costs: Complexity and algorithms |
scientific article |
Statements
Finding disjoint paths with different path-costs: Complexity and algorithms (English)
0 references
17 January 1993
0 references
disjoint paths
0 references
strongly NP-complete
0 references
polynomial time heuristics
0 references
