Finding the maximum cut by the greedy algorithm (Q1711379)
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 7003026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the maximum cut by the greedy algorithm |
scientific article; zbMATH DE number 7003026 |
Statements
Finding the maximum cut by the greedy algorithm (English)
0 references
17 January 2019
0 references
maximum cut
0 references
bipartite subgraph
0 references
linear ordering
0 references
0 references
0 references
0 references
0.8047576546669006
0 references
0.7998624444007874
0 references
0.7823000550270081
0 references
0.7799140810966492
0 references
0.7798174619674683
0 references
