Finding minimum 3-way cuts in hypergraphs (Q765477): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new and improved algorithm for the 3-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A divide-and-conquer approach to the minimum \(k\)-way cut problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Algorithm for Finding All Minimum <i>k</i>‐Way Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum 3-cuts and approximating k-cuts using Cut Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutsets and partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast hypergraph min-cut algorithm for circuit partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing minimum 3-way and 4-way cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum 3-Way Cuts in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts / rank
 
Normal rank

Latest revision as of 23:53, 4 July 2024

scientific article
Language Label Description Also known as
English
Finding minimum 3-way cuts in hypergraphs
scientific article

    Statements

    Finding minimum 3-way cuts in hypergraphs (English)
    0 references
    0 references
    19 March 2012
    0 references
    graph algorithms
    0 references
    \(k\)-way cut
    0 references
    edge-weighted hypergraph
    0 references
    minimum 3-way cut problem
    0 references

    Identifiers

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