Unbalanced graph partitioning (Q372961): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ang Sheng Li / rank
Normal rank
 
Property / author
 
Property / author: Ang Sheng Li / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6217431 / rank
 
Normal rank
Property / zbMATH Keywords
 
unbalanced cut
Property / zbMATH Keywords: unbalanced cut / rank
 
Normal rank
Property / zbMATH Keywords
 
sparsest cut
Property / zbMATH Keywords: sparsest cut / rank
 
Normal rank
Property / zbMATH Keywords
 
network community
Property / zbMATH Keywords: network community / rank
 
Normal rank
Property / zbMATH Keywords
 
social networks
Property / zbMATH Keywords: social networks / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-012-9436-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987654606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria global minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distortion and the sparsest cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut problems in graphs with a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:53, 6 July 2024

scientific article
Language Label Description Also known as
English
Unbalanced graph partitioning
scientific article

    Statements

    Unbalanced graph partitioning (English)
    0 references
    0 references
    0 references
    21 October 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    unbalanced cut
    0 references
    sparsest cut
    0 references
    network community
    0 references
    social networks
    0 references
    approximation algorithms
    0 references
    0 references