Image de couverture de livre

On the Complexity of Signed Roman Domination

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Reddy, Sangam Balchandar
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hardness and Algorithmic Results for Roman \{3\}-Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

On the complexity of global Roman domination problem in graphs
par: Reddy, Sangam Balchandar, et autres
Publié: (2026)

Algorithms for Minimum Membership Dominating Set Problem
par: Reddy, Sangam Balchandar, et autres
Publié: (2024)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

(Independent) Roman Domination Parameterized by Distance to Cluster
par: Ashok, Pradeesha, et autres
Publié: (2024)

Dominating Set Knapsack: Profit Optimization on Dominating Sets
par: Singh, Sipra
Publié: (2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Residue Domination in Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2024)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Fine-Grained Classification Of Detecting Dominating Patterns
par: Dransfeld, Jonathan, et autres
Publié: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
par: Herrmann, Anton, et autres
Publié: (2025)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
par: Chu, Huairui, et autres
Publié: (2023)

On $[1,2]$-Domination in Interval and Circle Graphs
par: Meybodi, Mohsen Alambardar, et autres
Publié: (2024)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

The Complexity of Finding and Counting Subtournaments
par: Döring, Simon, et autres
Publié: (2025)

On the Space Complexity of Online Convolution
par: Andersson, Joel Daniel, et autres
Publié: (2025)

Computational Complexity in Property Testing
par: Pinto Jr., Renato Ferreira, et autres
Publié: (2025)

The Complexity of Counting Small Sub-Hypergraphs
par: Bressan, Marco, et autres
Publié: (2025)

The Complexity of Maximal Common Subsequence Enumeration
par: Buzzega, Giovanni, et autres
Publié: (2025)

The Fine-Grained Complexity of Episode Matching
par: Bille, Philip, et autres
Publié: (2021)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

Novel Complexity Results for Temporal Separators with Deadlines
par: Dondi, Riccardo, et autres
Publié: (2025)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

Streaming Complexity Separations for Dense and Sparse Graphs
par: Liu, Yang P., et autres
Publié: (2026)

The Query Complexity of Local Search and Brouwer in Rounds
par: Brânzei, Simina, et autres
Publié: (2020)

On the Complexity of Fundamental Problems for DAG-Compressed Graphs
par: Chudigiewitsch, Florian, et autres
Publié: (2026)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
par: Kurita, Kazuhiro, et autres
Publié: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
par: Chen, Xi, et autres
Publié: (2026)

The Query Complexity of Local Search in Rounds on General Graphs
par: Brânzei, Simina, et autres
Publié: (2026)

On the Complexity of 2-club Cluster Editing with Vertex Splitting
par: Abu-Khzam, Faisal N., et autres
Publié: (2024)

On the Complexity of Minimizing Energy Consumption of Partitioning DAG Tasks
par: Liu, Wei, et autres
Publié: (2024)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
par: Cordasco, Gennaro, et autres
Publié: (2024)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
par: Lehner, Lisa, et autres
Publié: (2025)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
par: Focke, Jacob, et autres
Publié: (2023)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
par: Assadi, Sepehr, et autres
Publié: (2024)