Imagen de Portada

Algorithms for Minimum Membership Dominating Set Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Reddy, Sangam Balchandar, Kare, Anjeneya Swami
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Complexity 05C85, 68Q17, 68Q27
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
por: Alpay, Faruk, et al.
Publicado: (2026)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
por: Abdullah, Duaa, et al.
Publicado: (2025)

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph
por: Li, Xingfu, et al.
Publicado: (2026)

Steiner Tree Parameterized by Multiway Cut and Even Less
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

On weighted graph separation problems and flow-augmentation
por: Kim, Eun Jung, et al.
Publicado: (2022)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
por: Larrauri, Alberto
Publicado: (2025)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
por: Philip, Geevarghese, et al.
Publicado: (2026)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
por: Cui, Jinchuan, et al.
Publicado: (2022)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
por: Wang, Chen, et al.
Publicado: (2023)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
por: Datta, Swarnalipa, et al.
Publicado: (2026)

A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality
por: Logsdon, Sara, et al.
Publicado: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

DAG Scheduling in the BSP Model
por: Papp, Pál András, et al.
Publicado: (2023)

On the complexity of global Roman domination problem in graphs
por: Reddy, Sangam Balchandar, et al.
Publicado: (2026)

The Upper Clique Transversal Problem
por: Milanič, Martin, et al.
Publicado: (2023)

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

On Binary Networked Public Goods Game with Altruism
por: Maiti, Arnab, et al.
Publicado: (2022)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
por: Liu, Bowen
Publicado: (2025)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
por: Goerigk, Marc, et al.
Publicado: (2026)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

On the Complexity of Signed Roman Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

The n-vehicle exploration problem is NP-complete
por: Cui, Jinchuan, et al.
Publicado: (2023)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
por: Jiang, Xinwen, et al.
Publicado: (2021)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
por: Bannach, Max, et al.
Publicado: (2025)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
por: Golovach, Petr A., et al.
Publicado: (2022)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
por: Li, Zhangsong
Publicado: (2026)

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
por: Li, Xingfu
Publicado: (2026)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
por: Mühlenthaler, Moritz, et al.
Publicado: (2024)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
por: Li, Zhangsong
Publicado: (2025)

On the joint embedding property for cographs and trees
por: Carter, Daniel
Publicado: (2024)

Parameterized Algorithms for Kidney Exchange
por: Maiti, Arnab, et al.
Publicado: (2021)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
por: Hoang, Duc A.
Publicado: (2022)

A New Temporal Interpretation of Cluster Editing
por: Bocci, Cristiano, et al.
Publicado: (2022)

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., et al.
Publicado: (2026)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)