Counting and sampling minimum cuts in genus g graphs (Q5174485)
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 6405133
| 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 6405133 |
Statements
Counting and sampling minimum cuts in genus g graphs (English)
0 references
17 February 2015
0 references
computational topology
0 references
minimum cuts
0 references
topological graph theory
0 references
0.9999999
0 references
0.8972513
0 references
0.8922708
0 references
0.8681441
0 references
0.86664927
0 references
0.85892856
0 references
