I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q341397
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: XiaoHong Guan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ANF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HyperLogLog / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WebGraph / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GraphChi / 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.1016/j.ins.2017.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2592759774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick Detection of Nodes with Large Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality of groups and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking of Closeness Centrality for Large-Scale Social Networks / rank
 
Normal rank

Latest revision as of 17:53, 21 July 2024

scientific article
Language Label Description Also known as
English
I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
scientific article

    Statements

    I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2020
    0 references
    online social network
    0 references
    group centrality
    0 references
    disk-resident graph
    0 references
    submodularity
    0 references
    greedy algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers