Max-min weight balanced connected partition (Q386475): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Max-min partitioning of grid graphs into connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for max-min partitioning of ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of trapezoid graphs / 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: Trapezoid graphs and their coloring / 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: Q4166780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of some Maximum Spanning Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to solve connectivity problem on trapezoid graphs / 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: Clustering on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncontractable 4-connected graphs / 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: A linear algorithm for bipartition of biconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / 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 04:11, 7 July 2024

scientific article
Language Label Description Also known as
English
Max-min weight balanced connected partition
scientific article

    Statements

    Max-min weight balanced connected partition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    balanced connected partition
    0 references
    pseudo-polynomial time algorithm
    0 references
    FPTAS
    0 references

    Identifiers