The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 10:04, 1 February 2024

scientific article
Language Label Description Also known as
English
The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
scientific article

    Statements

    The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (English)
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    graph partitioning
    0 references
    combinatorial cuts
    0 references