Counting and sampling minimum cuts in genus \(g\) graphs (Q471138)
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 6369425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and sampling minimum cuts in genus \(g\) graphs |
scientific article; zbMATH DE number 6369425 |
Statements
Counting and sampling minimum cuts in genus \(g\) graphs (English)
0 references
14 November 2014
0 references
topological graph theory
0 references
computational topology
0 references
minimum cuts
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9948915839195251
0 references
0.861797034740448
0 references
0.8394259810447693
0 references
0.8370172381401062
0 references
