Imagen de Portada

Connected Partitions via Connected Dominating Sets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Niklanovits, Aikaterini, Simonov, Kirill, Verma, Shaily, Zeif, Ziena
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Combining Crown Structures for Vulnerability Measures
por: Casel, Katrin, et al.
Publicado: (2024)

Finding Minimum Distance Preservers: A Parameterized Study
por: Simonov, Kirill, et al.
Publicado: (2026)

A New Approach for Approximating Directed Rooted Networks
por: Cohen, Sarel, et al.
Publicado: (2024)

Space Complexity of Vertex Connectivity Oracles
por: Pettie, Seth, et al.
Publicado: (2022)

Ghost Value Augmentation for $k$-Edge-Connectivity
por: Hershkowitz, D Ellis, et al.
Publicado: (2023)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
por: Biedl, Therese, et al.
Publicado: (2024)

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
por: Liu, Siyue, et al.
Publicado: (2026)

Analysis of a Random Local Search Algorithm for Dominating Set
por: Higl, Hendrik
Publicado: (2026)

Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
por: Korhonen, Tuukka
Publicado: (2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs
por: Filtser, Arnold, et al.
Publicado: (2024)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

On Computing Vertex Connectivity of 1-Plane Graphs
por: Biedl, Therese, et al.
Publicado: (2022)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
por: Gavva, Surya Teja, et al.
Publicado: (2025)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
por: Mallek, Nadym, et al.
Publicado: (2025)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
por: Babatunde, Abiola, et al.
Publicado: (2026)

Edge Clique Partition and Cover Beyond Independence
por: Fomin, Fedor V., et al.
Publicado: (2025)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

Binary $k$-Center with Missing Entries: Structure Leads to Tractability
por: Soheil, Farehe, et al.
Publicado: (2025)

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

Sampling Tree-Weighted Partitions Without Sampling Trees
por: Cannon, Sarah, et al.
Publicado: (2025)

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

Approximately Dominating Sets in Elections
por: Charikar, Moses, et al.
Publicado: (2025)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
por: Feghali, Carl, et al.
Publicado: (2025)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
por: Ahmadypour, Niloufar, et al.
Publicado: (2020)

Fast Rational Search via Stern-Brocot Tree
por: Weyers, Connor, et al.
Publicado: (2025)

A Unified View of Graph Regularity via Matrix Decompositions
por: Bodwin, Greg, et al.
Publicado: (2019)

Improved space-time tradeoff for TSP via extremal set systems
por: Dallant, Justin, et al.
Publicado: (2026)

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

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
por: Blažej, Václav, et al.
Publicado: (2024)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
por: Scheinerman, Danny
Publicado: (2024)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
por: Glover, Charles N.
Publicado: (2024)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
por: Petersen, Johannes B. S., et al.
Publicado: (2025)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
por: D'Angelo, Gianlorenzo, et al.
Publicado: (2025)