Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum number of disjoint paths connecting specified terminals in a graph |
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
