Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Effect of New Links on Google Pagerank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing the spread of influence in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing PageRank via outlinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / 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: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Statistics with Reliability, Queuing and Computer Science Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs / rank
 
Normal rank

Revision as of 16:15, 23 July 2024

scientific article
Language Label Description Also known as
English
Optimizing node discovery on networks: problem definitions, fast algorithms, and observations
scientific article

    Statements

    Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2020
    0 references
    submodular/supermodular set function
    0 references
    greedy algorithm
    0 references
    MCMC simulation
    0 references
    random walk
    0 references

    Identifiers