Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
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: 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: Q6075914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the maximally balanced connected graph tripartition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximally balanced connected graph partition / 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: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / 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: Cut and flow formulations for the balanced connected \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into balanced connected classes: formulations, separation and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and parameterized algorithms for balanced connected partition problems / 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: FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS / rank
 
Normal rank

Revision as of 11:19, 2 August 2024

scientific article; zbMATH DE number 7721469
Language Label Description Also known as
English
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
scientific article; zbMATH DE number 7721469

    Statements

    Balanced connected partitions of graphs: approximation, parameterization and lower bounds (English)
    0 references
    0 references
    0 references
    0 references
    2 August 2023
    0 references
    balanced connected partition
    0 references
    fractional partition
    0 references
    approximation algorithms
    0 references
    fixed parameter tractable
    0 references
    complexity lower bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references