Maximum cuts and judicious partitions in graphs without short cycles (Q1400968)
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 1965038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum cuts and judicious partitions in graphs without short cycles |
scientific article; zbMATH DE number 1965038 |
Statements
Maximum cuts and judicious partitions in graphs without short cycles (English)
0 references
17 August 2003
0 references
bipartite cut problem
0 references
0.8386727571487427
0 references
0.8381374478340149
0 references
0.8347694277763367
0 references
0.8347694277763367
0 references
0.83076012134552
0 references
