Some New Matroids on Graphs: Cut Sets and the Max Cut Problem (Q3768702)
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 4027205
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some New Matroids on Graphs: Cut Sets and the Max Cut Problem |
scientific article; zbMATH DE number 4027205 |
Statements
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem (English)
0 references
1987
0 references
matroids
0 references
edge set of a graph
0 references
polynomial algorithm
0 references
minimum weight circuit
0 references
0.8176977038383484
0 references
0.8103626370429993
0 references
0.8038563132286072
0 references
0.7872794270515442
0 references
