Ford-Fulkerson algorithm and short cycles in embedded graphs (Q5319630)
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: Ford-Fulkerson algorithm and short cycles in embedded graphs |
scientific article; zbMATH DE number 5584115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ford-Fulkerson algorithm and short cycles in embedded graphs |
scientific article; zbMATH DE number 5584115 |
Statements
22 July 2009
0 references
co-cycle
0 references
separating cycle
0 references
contractible cycle
0 references
twosided cycle
0 references
0.8117959499359131
0 references
0.8117958903312683
0 references
0.8062076568603516
0 references
0.7981537580490112
0 references
0.7958660125732422
0 references
