Solving target set selection with bounded thresholds faster than 2ⁿ
From MaRDI portal
Publication:2684482
Recommendations
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Target set selection parameterized by clique-width and maximum threshold
- Constant thresholds can make target set selection tractable
- Parameterized inapproximability of target set selection and generalizations
- Parameterized inapproximability of target set selection and generalizations
Cites work
- Bootstrap percolation in high dimensions
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Capacitated domination faster than \(O(2^{n })\)
- Combinatorial model and bounds for target set selection
- Constant thresholds can make target set selection tractable
- Enumerating minimal subset feedback vertex sets
- Exact algorithm for the maximum induced planar subgraph problem
- Exact exponential algorithms.
- Finding a maximum induced degenerate subgraph faster than \(2^{n}\)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 52032 (Why is no real title available?)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Irreversible conversion of graphs
- Largest Chordal and Interval Subgraphs Faster Than 2 n
- On the approximability of influence in social networks
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Parameterized approximability of maximizing the spread of influence in networks
- Parameterized graph separation problems
- Scheduling partially ordered jobs faster than \(2^n\)
- Size bounds for dynamic monopolies
- Solving connected dominating set faster than \(2^n\)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
- Target set selection in dense graph classes
- Target set selection parameterized by clique-width and maximum threshold
- The traveling salesman problem in bounded degree graphs
- Treewidth governs the complexity of target set selection
Cited in
(19)- Some results on the target set selection problem
- The t-latency bounded strong target set selection problem in some kinds of special family of graphs
- Target set selection parameterized by vertex cover and more
- Constant thresholds can make target set selection tractable
- Exact solutions for latency-bounded target set selection problem on some special families of graphs
- Domination and convexity problems in the target set selection model
- Treewidth governs the complexity of target set selection
- Constant thresholds can make target set selection tractable
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Target set selection in dense graph classes
- Target set selection parameterized by clique-width and maximum threshold
- Parameterized inapproximability of target set selection and generalizations
- Parameterized inapproximability of target set selection and generalizations
- Target set selection problem for honeycomb networks
- Latency-bounded target set selection in social networks
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
- Target set selection with maximum activation time
- On the complexity of target set selection in simple geometric networks
- Tight inapproximability of target set reconfiguration
This page was built for publication: Solving target set selection with bounded thresholds faster than \(2^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2684482)
