Imagen de Portada

The Counting General Dominating Set Framework

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zheng, Jiayi, Meng, Boning
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

From an odd arity signature to a Holant dichotomy
por: Meng, Boning, et al.
Publicado: (2025)

Dichotomies for \#CSP on graphs that forbid a clique as a minor
por: Meng, Boning, et al.
Publicado: (2025)

Matchgate signatures under variable permutations
por: Meng, Boning, et al.
Publicado: (2025)

P-time Algorithms for Typical #EO Problems
por: Meng, Boning, et al.
Publicado: (2024)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
por: Meng, Boning, et al.
Publicado: (2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
por: Focke, Jacob, et al.
Publicado: (2022)

Dominating Set Knapsack: Profit Optimization on Dominating Sets
por: Singh, Sipra
Publicado: (2025)

Low Sets and Closure Properties of Counting Function Classes
por: Ivanashev, Yaroslav
Publicado: (2025)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
por: Rai, Ashutosh, et al.
Publicado: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
por: Greilhuber, Jakob, et al.
Publicado: (2025)

Temporal Reachability Dominating Sets: contagion in temporal graphs
por: Kutner, David C., et al.
Publicado: (2023)

Continuous Defensive Domination Problems
por: Grüne, Christoph, et al.
Publicado: (2026)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
por: Chu, Huairui, et al.
Publicado: (2023)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

A Note on the Complexity of Defensive Domination
por: Chaplick, Steven, et al.
Publicado: (2025)

On the Parameterized Complexity of Semitotal Domination on Graph Classes
por: Retschmeier, Lukas
Publicado: (2025)

The Complexity of Logarithmic Space Bounded Counting Classes
por: Vijayaraghavan, T. C.
Publicado: (2025)

Lower Bounds for Subset Sum in Resolution with Modular Counting
por: Part, Fedor
Publicado: (2022)

Hilbert's Nullstellensatz is in the Counting Hierarchy
por: Andrews, Robert, et al.
Publicado: (2026)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2026)

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
por: Abu-Khzam, Faisal N., et al.
Publicado: (2024)

Counting Triangulations of Fixed Cardinal Degrees
por: Chambers, Erin, et al.
Publicado: (2025)

Learning DFAs from Positive Examples Only via Word Counting
por: Bordais, Benjamin, et al.
Publicado: (2025)

From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
por: Hecher, Markus, et al.
Publicado: (2025)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
por: Lauerbach, Antonio, et al.
Publicado: (2024)

Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
por: Nkosi, Thami
Publicado: (2025)

Enumeration With Nice Roman Domination Properties
por: Mann, Kevin
Publicado: (2025)

Hardness of SetCover Reoptimization
por: Jansen, Klaus, et al.
Publicado: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
por: Zheng, Jingwen, et al.
Publicado: (2026)

Special Coverings of Sets and Boolean Functions
por: Margaryan, Stepan
Publicado: (2024)

Modular Counting CSP: Reductions and Algorithms
por: Kazeminia, Amirhossein, et al.
Publicado: (2025)

Lower Bounds for Set-Multilinear Branching Programs
por: Chatterjee, Prerona, et al.
Publicado: (2023)

Lower Bounds from Succinct Hitting Sets
por: Chatterjee, Prerona, et al.
Publicado: (2023)

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

Counting Subgraphs in Somewhere Dense Graphs
por: Bressan, Marco, et al.
Publicado: (2022)

Feedback Set Problems on Bounded-Degree (Planar) Graphs
por: Bai, Tian, et al.
Publicado: (2026)

On the Complexity of Target Set Selection in Simple Geometric Networks
por: Dvořák, Michal, et al.
Publicado: (2023)

Optimal Proof Systems for Complex Sets are Hard to Find
por: Egidy, Fabian, et al.
Publicado: (2024)

Finite Variable Counting Logics with Restricted Requantification
por: Raßmann, Simon, et al.
Publicado: (2024)