Treewidth governs the complexity of target set selection (Q456700): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6094035 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
target set selection | |||
Property / zbMATH Keywords: target set selection / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bounded tree-width algorithm | |||
Property / zbMATH Keywords: bounded tree-width algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bounded tree-width lower-bound | |||
Property / zbMATH Keywords: bounded tree-width lower-bound / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
viral marketing | |||
Property / zbMATH Keywords: viral marketing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
social networks | |||
Property / zbMATH Keywords: social networks / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
game of life | |||
Property / zbMATH Keywords: game of life / 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.disopt.2010.09.007 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2148732839 / 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: Q3549607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3579502 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic monopolies of constant size / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Contagion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Size bounds for dynamic monopolies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On treewidth approximations. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4246749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4291429 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:13, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Treewidth governs the complexity of target set selection |
scientific article |
Statements
Treewidth governs the complexity of target set selection (English)
0 references
16 October 2012
0 references
target set selection
0 references
bounded tree-width algorithm
0 references
bounded tree-width lower-bound
0 references
viral marketing
0 references
social networks
0 references
game of life
0 references
0 references