Two local dissimilarity measures for weighted graphs with application to protein interaction networks (Q949442): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BIONJ / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61198250 / 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/s11634-008-0018-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054360688 / 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: Q3702302 / 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: Comparing recent methods in graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms in graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Communities in Large Networks Using Random Walks / rank
 
Normal rank

Latest revision as of 18:39, 28 June 2024

scientific article
Language Label Description Also known as
English
Two local dissimilarity measures for weighted graphs with application to protein interaction networks
scientific article

    Statements

    Two local dissimilarity measures for weighted graphs with application to protein interaction networks (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    graph distance
    0 references
    graph partitioning
    0 references
    heuristic optimisation
    0 references
    biological networks
    0 references
    0 references
    0 references
    0 references
    0 references