The complexity of influence maximization problem in the deterministic linear threshold model (Q1928515): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s10878-011-9393-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995323604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS / rank
 
Normal rank

Latest revision as of 01:04, 6 July 2024

scientific article
Language Label Description Also known as
English
The complexity of influence maximization problem in the deterministic linear threshold model
scientific article

    Statements

    The complexity of influence maximization problem in the deterministic linear threshold model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    inapproximation
    0 references
    deterministic model
    0 references
    social network
    0 references

    Identifiers