Logarithmic hardness of the undirected edge-disjoint paths problem (Q3455215)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logarithmic hardness of the undirected edge-disjoint paths problem |
scientific article |
Statements
Logarithmic hardness of the undirected edge-disjoint paths problem (English)
0 references
4 December 2015
0 references
hardness of approximation
0 references
edge-disjoint paths
0 references
undirected graphs
0 references
