Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Balanced Partition of Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min partitioning of grid graphs into connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting algorithms for tree partitioning with general weighting functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shifting Algorithm for Min-Max Tree Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Maximally Balanced Connected Partition Problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\gamma\)-connected assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138951 / 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: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most uniform path partitioning and its use in image processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut and flow formulations for the balanced connected \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Min Tree Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Balanced Connected Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS / rank
 
Normal rank

Latest revision as of 21:40, 25 July 2024

scientific article
Language Label Description Also known as
English
Partitioning a graph into balanced connected classes: formulations, separation and experiments
scientific article

    Statements

    Partitioning a graph into balanced connected classes: formulations, separation and experiments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2021
    0 references
    integer programming
    0 references
    branch-and-cut
    0 references
    separation algorithm
    0 references
    balanced partition
    0 references
    connected partition
    0 references

    Identifiers

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