Packing odd <i>T</i>‐joins with at most two terminals (Q4638649)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6865396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing odd <i>T</i>‐joins with at most two terminals |
scientific article; zbMATH DE number 6865396 |
Statements
Packing odd <i>T</i>‐joins with at most two terminals (English)
0 references
27 April 2018
0 references
binary clutters
0 references
cycling conjecture
0 references
network flows
0 references
odd st-joins
0 references
weakly bipartite graphs
0 references
0 references
0.8569096
0 references
0.85302657
0 references
0.84709656
0 references
0.8366779
0 references
0 references
0.8347456
0 references
0.8328048
0 references
