Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088)

From MaRDI portal
Revision as of 18:23, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    28 April 1994
    0 references
    max cut
    0 references
    connected graph
    0 references
    bipartite subgraph
    0 references
    \(k\)-colourable subgraph
    0 references

    Identifiers