A combinatorial model and algorithm for globally searching community structure in complex networks (Q437056): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9356-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065555371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity-maximizing graph communities via mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / 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: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank

Latest revision as of 12:08, 5 July 2024

scientific article
Language Label Description Also known as
English
A combinatorial model and algorithm for globally searching community structure in complex networks
scientific article

    Statements

    A combinatorial model and algorithm for globally searching community structure in complex networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 July 2012
    0 references
    complex network
    0 references
    community structure
    0 references
    heuristic algorithm
    0 references
    linear integer programming
    0 references
    NP-hard
    0 references

    Identifiers