Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:17, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum number of disjoint paths connecting specified terminals in a graph |
scientific article |
Statements
Maximum number of disjoint paths connecting specified terminals in a graph (English)
0 references
5 July 1995
0 references
matching problem
0 references
odd \(T\)-disconnector
0 references
