On the complexity of finding balanced oneway cuts (Q1014383)

From MaRDI portal
Revision as of 11:58, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of finding balanced oneway cuts
scientific article

    Statements

    title
    On the complexity of finding balanced oneway cuts (English)
    0 references
    author
    Uriel Feige
    0 references
    Orly Yahalom
    0 references
    publication date
    28 April 2009
    0 references
    zbMATH Keywords
    bisection
    0 references
    directed graph
    0 references
    NP-hard
    0 references
    graph algorithms
    0 references

    Identifiers

    zbMATH DE Number
    5547769
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1014383&oldid=35104946"
    Powered by MediaWiki