Domination and convexity problems in the target set selection model
From MaRDI portal
Publication:2689641
DOI10.1016/J.DAM.2022.12.021OpenAlexW4313479298MaRDI QIDQ2689641FDOQ2689641
Authors: Rudini M. Sampaio, Rafael T. Araújo 
Publication date: 13 March 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.021
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
- Fundamentals of parameterized complexity
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- On local convexity in graphs
- A partial k-arboretum of graphs with bounded treewidth
- Linear time solvable optimization problems on graphs of bounded clique-width
- Title not available (Why is that?)
- On the approximability of influence in social networks
- Convexity in Graphs and Hypergraphs
- Treewidth governs the complexity of target set selection
- On the clique-width of some perfect graph classes
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex sets in graphs. II: Minimal path convexity
- On triangle path convexity in graphs
- On the convexity number of graphs
- Complexity aspects of the triangle path convexity
- On the Carathéodory number for the convexity of paths of order three
- Convex partitions of graphs induced by paths of order three
- Complexity results related to monophonic convexity
- On the approximability and exact algorithms for vector domination and related problems in graphs
- (Total) vector domination for graphs with bounded branchwidth
- The hull number of a graph
- Diameter and treewidth in minor-closed graph families
- Approximation hardness of dominating set problems in bounded degree graphs
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs
- On graphs with equal domination and 2-domination numbers
- On the Carathéodory number of interval and graph convexities
- Title not available (Why is that?)
- Algorithmic aspects of the \(k\)-domination problem in graphs
- On miniaturized problems in parameterized complexity theory
- On the Radon number for \(P _{3}\)-convexity
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- On the convexity of paths of length two in undirected graphs
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Constant thresholds can make target set selection tractable
- Parameterized inapproximability of target set selection and generalizations
- A note on the interval number of a graph
- Title not available (Why is that?)
- Latency-bounded target set selection in social networks
- The convexity of induced paths of order three and applications: complexity aspects
- Approximating fault-tolerant domination in general graphs
- On some tractable and hard instances for partial incentives and target set selection
- On the computational complexity of the Helly number in the \(P_3\) and related convexities
- Vector domination in split-indifference graphs
- On interval number in cycle convexity
- Complexity results for \(k\)-domination and \(\alpha\)-domination problems and their variants.
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)
