Exact cuts in networks (Q3827810): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stochastic Shortest Route Problem / rank
 
Normal rank

Latest revision as of 15:31, 19 June 2024

scientific article
Language Label Description Also known as
English
Exact cuts in networks
scientific article

    Statements

    Exact cuts in networks (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    exact cut
    0 references
    source-sink network
    0 references
    source-sink path
    0 references
    polynomially equivalent
    0 references
    NP-hard
    0 references
    polynomial time algorithms
    0 references
    maximum weight exact cut problem
    0 references
    0 references
    0 references
    0 references
    0 references