The complexity of finding effectors (Q519899): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+The Complexity of Finding Effectors
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6487893
@@ Property / title @@
+The Complexity of Finding Effectors (English)
@@ Property / title: The Complexity of Finding Effectors (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68101
@@ Property / zbMATH Open document ID: 1362.68101 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-17142-5_20
@@ Property / DOI: 10.1007/978-3-319-17142-5_20 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2015Timestamp +2015-09-30T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-09-30T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 30 September 2015 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6487893
@@ Property / zbMATH DE Number: 6487893 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1632976971
@@ Property / OpenAlex ID: W1632976971 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2619074938
@@ Property / OpenAlex ID: W2619074938 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62039059
@@ Property / Wikidata QID: Q62039059 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62039079
@@ Property / Wikidata QID: Q62039079 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7838
@@ Property / arXiv ID: 1411.7838 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Explaining Snapshots of Network Diffusions: Structural and Hardness Results
+Normal rank
@@ Property / cites work @@
+Treewidth governs the complexity of target set selection
+Normal rank
@@ Property / cites work @@
+Constant thresholds can make target set selection tractable
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Scalable influence maximization for independent cascade model in large-scale social networks
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Inapproximability of Target Set Selection and Generalizations
+Normal rank
@@ Property / cites work @@
+Parameterized approximability of maximizing the spread of influence in networks
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+On Tractable Cases of Target Set Selection
@@ Property / cites work: On Tractable Cases of Target Set Selection / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / DBLP publication ID @@
+conf/tamc/BulteauFFNT15
@@ Property / DBLP publication ID: conf/tamc/BulteauFFNT15 / rank @@
+Normal rank