The Maximum Edge-Disjoint Paths Problem in Bidirected Trees (Q2753529): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Klaus Jansen / rank | |||
| Property / author | |||
| Property / author: Klaus Jansen / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:20, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Maximum Edge-Disjoint Paths Problem in Bidirected Trees |
scientific article |
Statements
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees (English)
0 references
11 November 2001
0 references
approximation algorithms
0 references
edge-disjoint paths
0 references
bidirected trees
0 references
