Comparison of algorithms in graph partitioning (Q3163669): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1051/ro:2008029 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MCODE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005769680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent directions in netlist partitioning: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum transfer distance between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing metric distances between partitions / 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: Computing Communities in Large Networks Using Random Walks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/RO:2008029 / rank
 
Normal rank

Latest revision as of 19:56, 20 December 2024

scientific article
Language Label Description Also known as
English
Comparison of algorithms in graph partitioning
scientific article

    Statements

    Identifiers

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