Max-multiflow/min-multicut for G+H series-parallel (Q2275455): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal multicut and maximal integer multiflow: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integer Multiflow Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to multicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planar integer two-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiflow Feasibility: An Annotated Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-disjoint paths problem is NP-complete for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer plane multiflows with a mixed number of demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Clique-Web Facets for Multicut Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding edge-disjoint paths in partial \(k\)-trees / rank
 
Normal rank

Latest revision as of 09:44, 4 July 2024

scientific article
Language Label Description Also known as
English
Max-multiflow/min-multicut for G+H series-parallel
scientific article

    Statements

    Max-multiflow/min-multicut for G+H series-parallel (English)
    0 references
    0 references
    9 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum integer multiflow
    0 references
    minimum multicut
    0 references
    min-max equality
    0 references
    0 references