Copertina

On the complexity of global Roman domination problem in graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Reddy, Sangam Balchandar, Das, Arun Kumar, Kare, Anjeneya Swami, Reddy, I. Vinod
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Combinatorics Computational Complexity Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Algorithms for Minimum Membership Dominating Set Problem
di: Reddy, Sangam Balchandar, et al.
Pubblicazione: (2024)

On the Complexity of Signed Roman Domination
di: Reddy, Sangam Balchandar
Pubblicazione: (2025)

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

On the Parameterized Complexity of Odd Coloring
di: Bhyravarapu, Sriram, et al.
Pubblicazione: (2025)

(Independent) Roman Domination Parameterized by Distance to Cluster
di: Ashok, Pradeesha, et al.
Pubblicazione: (2024)

Self-referential instances of the dominating set problem are irreducible
di: Zhou, Guangyan
Pubblicazione: (2026)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
di: Bousquet, Nicolas, et al.
Pubblicazione: (2025)

Isometric path complexity of graphs
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2022)

Smoothed analysis for graph isomorphism
di: Anastos, Michael, et al.
Pubblicazione: (2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
di: Le, Hoang-Oanh, et al.
Pubblicazione: (2024)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Some easy optimization problems have the overlap-gap property
di: Li, Shuangping, et al.
Pubblicazione: (2024)

Precoloring extension with demands on paths
di: Das, Arun Kumar, et al.
Pubblicazione: (2025)

Computational Complexity of Swish
di: Horiyama, Takashi, et al.
Pubblicazione: (2026)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
di: Abboud, Amir, et al.
Pubblicazione: (2026)

Hypergraph Samplers: Typical and Worst Case Behavior
di: Alev, Vedat Levi, et al.
Pubblicazione: (2026)

On Detecting $H$-Induced Minors for Small $H$
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2026)

Parameterized Shortest Path Reconfiguration
di: Bousquet, Nicolas, et al.
Pubblicazione: (2024)

Forest Covers and Bounded Forest Covers
di: Gaur, Daya Ram, et al.
Pubblicazione: (2024)

Constant congestion linkages in polynomially strong digraphs in polynomial time
di: Lopes, Raul, et al.
Pubblicazione: (2024)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
di: Leake, Jonathan, et al.
Pubblicazione: (2025)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
di: Gribanov, Dmitry, et al.
Pubblicazione: (2022)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
di: Mu, Ta-Yu, et al.
Pubblicazione: (2024)

On $[1,2]$-Domination in Interval and Circle Graphs
di: Meybodi, Mohsen Alambardar, et al.
Pubblicazione: (2024)

Fourier Analysis of Iterative Algorithms
di: Jones, Chris, et al.
Pubblicazione: (2024)

Kernelization Complexity of Solution Discovery Problems
di: Grobler, Mario, et al.
Pubblicazione: (2024)

A General Framework for Low Soundness Homomorphism Testing
di: Mittal, Tushant, et al.
Pubblicazione: (2025)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
di: Leake, Jonathan, et al.
Pubblicazione: (2025)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
di: Casteigts, Arnaud, et al.
Pubblicazione: (2020)

Computing the $D$-base and $D$-relation in finite closure systems
di: Adaricheva, Kira, et al.
Pubblicazione: (2024)

Testing Sumsets is Hard
di: Chen, Xi, et al.
Pubblicazione: (2024)

A Refined Laser Method and Faster Matrix Multiplication
di: Alman, Josh, et al.
Pubblicazione: (2020)

A Fast Coloring Oracle for Average Case Hypergraphs
di: Marcussen, Cassandra, et al.
Pubblicazione: (2025)

Deciding if a DAG is Interesting is Hard
di: De Carufel, Jean-Lou, et al.
Pubblicazione: (2025)

Characterizing and Testing Principal Minor Equivalence of Matrices
di: Chatterjee, Abhranil, et al.
Pubblicazione: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
di: Lee, Euiwoong, et al.
Pubblicazione: (2024)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
di: Gaspers, Serge, et al.
Pubblicazione: (2025)

On graphs coverable by k shortest paths
di: Dumas, Maël, et al.
Pubblicazione: (2022)

The complexity of testing all properties of planar graphs, and the role of isomorphism
di: Basu, Sabyasachi, et al.
Pubblicazione: (2021)