Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6059771 / rank
 
Normal rank
Property / zbMATH Keywords
 
hypergraph partitioning
Property / zbMATH Keywords: hypergraph partitioning / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-level paradigm
Property / zbMATH Keywords: multi-level paradigm / rank
 
Normal rank
Property / zbMATH Keywords
 
recursive bisection
Property / zbMATH Keywords: recursive bisection / rank
 
Normal rank
Property / zbMATH Keywords
 
direct \(K\)-way refinement
Property / zbMATH Keywords: direct \(K\)-way refinement / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-constraint
Property / zbMATH Keywords: multi-constraint / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed vertices
Property / zbMATH Keywords: fixed vertices / rank
 
Normal rank

Revision as of 00:09, 30 June 2023

scientific article
Language Label Description Also known as
English
Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
scientific article

    Statements

    Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2012
    0 references
    hypergraph partitioning
    0 references
    multi-level paradigm
    0 references
    recursive bisection
    0 references
    direct \(K\)-way refinement
    0 references
    multi-constraint
    0 references
    fixed vertices
    0 references

    Identifiers