Flows in one-crossing-minor-free graphs (Q4913762)
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: Flows in one-crossing-minor-free graphs |
scientific article; zbMATH DE number 6152229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flows in one-crossing-minor-free graphs |
scientific article; zbMATH DE number 6152229 |
Statements
Flows in One-Crossing-Minor-Free Graphs (English)
0 references
9 April 2013
0 references
maximum flow problem
0 references
0.9985730648040771
0 references
0.8043110370635986
0 references
0.7997403740882874
0 references
0.7616141438484192
0 references
0.7600873708724976
0 references
