Multiway cuts in directed and node weighted graphs (Q4632450): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiway cut polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate max-flow min-(multi)cut theorems and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341921 / rank
 
Normal rank

Latest revision as of 01:54, 19 July 2024

scientific article; zbMATH DE number 7048698
Language Label Description Also known as
English
Multiway cuts in directed and node weighted graphs
scientific article; zbMATH DE number 7048698

    Statements

    Multiway cuts in directed and node weighted graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2019
    0 references
    polynomial time
    0 references
    node version
    0 references
    distance label
    0 references
    multicommodity flow
    0 references
    complementary slackness condition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references