On the sum-max graph partitioning problem (Q2453173): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2889270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of graph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Partition of Some Class of Graphs under Compaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-Max Graph Partitioning Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank

Revision as of 13:53, 8 July 2024

scientific article
Language Label Description Also known as
English
On the sum-max graph partitioning problem
scientific article

    Statements

    On the sum-max graph partitioning problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2014
    0 references
    graph partitioning problem
    0 references
    approximation algorithm
    0 references
    combinatorial optimization
    0 references

    Identifiers

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