Domination and convexity problems in the target set selection model
From MaRDI portal
Publication:2689641
Recommendations
- Target set selection with maximum activation time
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Parameterized inapproximability of target set selection and generalizations
- Parameterized inapproximability of target set selection and generalizations
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 731842 (Why is no real title available?)
- scientific article; zbMATH DE number 4121429 (Why is no real title available?)
- (Total) vector domination for graphs with bounded branchwidth
- A note on the interval number of a graph
- A partial k-arboretum of graphs with bounded treewidth
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Approximating fault-tolerant domination in general graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- Complexity aspects of the triangle path convexity
- Complexity results for \(k\)-domination and \(\alpha\)-domination problems and their variants.
- Complexity results related to monophonic convexity
- Constant thresholds can make target set selection tractable
- Convex partitions of graphs induced by paths of order three
- Convex sets in graphs. II: Minimal path convexity
- Convexity in Graphs and Hypergraphs
- Diameter and treewidth in minor-closed graph families
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Fundamentals of parameterized complexity
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Latency-bounded target set selection in social networks
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- On graphs with equal domination and 2-domination numbers
- On interval number in cycle convexity
- On local convexity in graphs
- On miniaturized problems in parameterized complexity theory
- On some tractable and hard instances for partial incentives and target set selection
- On the Carathéodory number for the convexity of paths of order three
- On the Carathéodory number of interval and graph convexities
- On the Radon number for \(P _{3}\)-convexity
- On the approximability and exact algorithms for vector domination and related problems in graphs
- On the approximability of influence in social networks
- On the clique-width of some perfect graph classes
- On the computational complexity of the Helly number in the \(P_3\) and related convexities
- On the convexity number of graphs
- On the convexity of paths of length two in undirected graphs
- On triangle path convexity in graphs
- Parameterized inapproximability of target set selection and generalizations
- The convexity of induced paths of order three and applications: complexity aspects
- The hull number of a graph
- Treewidth governs the complexity of target set selection
- Vector domination in split-indifference graphs
Cited in
(3)
This page was built for publication: Domination and convexity problems in the target set selection model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689641)
