Structural and algorithmic properties of 2-community structures (Q1635716): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59603515, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Unfriendly partitions of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-constrained decompositions of graphs: Bounded treewidth and planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfactory partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of satisfactory bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfactory graph partition, variants, and generalizations / 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: Balanced partitions of trees and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4604351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general view on computing communities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph clustering / rank
 
Normal rank

Latest revision as of 18:54, 15 July 2024

scientific article
Language Label Description Also known as
English
Structural and algorithmic properties of 2-community structures
scientific article

    Statements

    Structural and algorithmic properties of 2-community structures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 June 2018
    0 references
    complexity
    0 references
    graph partitioning
    0 references
    community structure
    0 references
    clustering
    0 references
    social networks
    0 references

    Identifiers

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