Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:10, 5 March 2024
scientific article; zbMATH DE number 558804
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-Time Approximation Algorithms for the Max Cut Problem |
scientific article; zbMATH DE number 558804 |
Statements
Linear-Time Approximation Algorithms for the Max Cut Problem (English)
0 references
28 April 1994
0 references
max cut
0 references
connected graph
0 references
bipartite subgraph
0 references
\(k\)-colourable subgraph
0 references
