Cuts in undirected graphs. II (Q2215853): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cuts in undirected graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum cut by the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank

Latest revision as of 04:36, 24 July 2024

scientific article
Language Label Description Also known as
English
Cuts in undirected graphs. II
scientific article

    Statements

    Cuts in undirected graphs. II (English)
    0 references
    0 references
    14 December 2020
    0 references
    graphs
    0 references
    cuts
    0 references
    convex function
    0 references
    special polyhedra
    0 references
    polymatroid
    0 references

    Identifiers