Approximation algorithms for maximally balanced connected graph partition (Q5918464): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-021-00870-3 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2979185190 / 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: Q5387695 / 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: Q2747613 / 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: 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: Max-Min Tree Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min weight balanced connected partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid 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
Property / DOI
 
Property / DOI: 10.1007/S00453-021-00870-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:10, 16 December 2024

scientific article; zbMATH DE number 7458817
Language Label Description Also known as
English
Approximation algorithms for maximally balanced connected graph partition
scientific article; zbMATH DE number 7458817

    Statements

    Approximation algorithms for maximally balanced connected graph partition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2022
    0 references
    graph partition
    0 references
    induced subgraph
    0 references
    connected component
    0 references
    local improvement
    0 references
    approximation algorithm
    0 references

    Identifiers