Imagen de Portada

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bentert, Matthias, Schestag, Jannik, Sommer, Frank
Formato:	Preprint
Publicado:	2023
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Who Should Have a Place on the Ark? Parameterized Algorithms for the Maximization of Phylogenetic Diversity
por: Schestag, Jannik
Publicado: (2025)

Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
por: Schestag, Jannik
Publicado: (2025)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
por: Bentert, Matthias, et al.
Publicado: (2026)

A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
por: Bentert, Matthias, et al.
Publicado: (2026)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
por: Goetze, Miriam, et al.
Publicado: (2024)

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
por: Matuschke, Jannik
Publicado: (2025)

Further Connectivity Results on Plane Spanning Path Reconfiguration
por: Boucard, Valentino, et al.
Publicado: (2024)

Finding Minimum Matching Cuts in $H$-free Graphs
por: Lucke, Felicia, et al.
Publicado: (2025)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
por: Bentert, Matthias, et al.
Publicado: (2024)

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

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
por: Komusiewicz, Christian, et al.
Publicado: (2025)

When does FTP become FPT?
por: Bentert, Matthias, et al.
Publicado: (2025)

Fault-Tolerant Matroid Bases
por: Bentert, Matthias, et al.
Publicado: (2025)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2024)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
por: Hanaka, Tesshu, et al.
Publicado: (2023)

On the Connectivity of the Flip Graph of Plane Spanning Paths
por: Kleist, Linda, et al.
Publicado: (2024)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
por: Ai, Jiangdong, et al.
Publicado: (2024)

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
por: D'Elia, Marco, et al.
Publicado: (2026)

Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
por: Brause, Christoph, et al.
Publicado: (2022)

Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2021)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
por: D'Elia, Marco, et al.
Publicado: (2024)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

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

The Complexity of Finding Tangles
por: Firman, Oksana, et al.
Publicado: (2020)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
por: Lozin, Vadim, et al.
Publicado: (2022)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
por: Dumitrescu, Adrian, et al.
Publicado: (2024)

A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
por: Zhang, Jiechen
Publicado: (2026)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Uniform Sampling and Visualization of 3D Reluctant Walks
por: Buckley, Benjamin, et al.
Publicado: (2024)

How to Reduce Temporal Cliques to Find Sparse Spanners
por: Angrick, Sebastian, et al.
Publicado: (2024)

Finding Minimal Clusters in st-DAGs
por: Vogl, Ulrich, et al.
Publicado: (2026)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
por: Bentert, Matthias, et al.
Publicado: (2025)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
por: Wu, Fei, et al.
Publicado: (2024)

The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models
por: Gunderson, Lee M, et al.
Publicado: (2024)

Chorded cycle facets of the clique partitioning polytope
por: Irmai, Jannik, et al.
Publicado: (2024)

Improved Dynamics for the Maximum Common Subgraph Problem
por: Guidobene, Davide, et al.
Publicado: (2024)

Constrained Flips in Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Flipping Non-Crossing Spanning Trees
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)

$O(p \log d)$ Subgraph Isomorphism using Stigmergic Swarming Agents
por: Parunak, H. Van Dyke
Publicado: (2025)