Graph Search Trees and the Intermezzo Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Beisegel, Jesse, Köhler, Ekkehard, Ratajczak, Fabienne, Scheffler, Robert, Strehler, Martin
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Discrete Mathematics Computational Complexity Data Structures and Algorithms Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Breadth-First Search Trees with Many or Few Leaves
di: Beisegel, Jesse, et al.
Pubblicazione: (2026)

Computing Hamiltonian Paths with Partial Order Restrictions
di: Beisegel, Jesse, et al.
Pubblicazione: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
di: Beisegel, Jesse, et al.
Pubblicazione: (2024)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
di: Scheffler, Robert
Pubblicazione: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
di: Bonomo-Braberman, Flavia, et al.
Pubblicazione: (2020)

Graph parameters that are coarsely equivalent to path-length
di: Dragan, Feodor F., et al.
Pubblicazione: (2025)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2025)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
di: Hellmuth, Marc, et al.
Pubblicazione: (2023)

Graph Classes Closed under Self-intersection
di: Dabrowski, Konrad K., et al.
Pubblicazione: (2025)

Steiner Forest for $H$-Subgraph-Free Graphs
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2026)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
di: Lucke, Felicia, et al.
Pubblicazione: (2024)

Space Efficient Algorithms for Parameterised Problems
di: Akhtar, Sheikh Shakil, et al.
Pubblicazione: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
di: Haviv, Ishay
Pubblicazione: (2022)

Computing Subset Vertex Covers in $H$-Free Graphs
di: Brettell, Nick, et al.
Pubblicazione: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
di: Dabrowski, Konrad K., et al.
Pubblicazione: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
di: Ahn, Jungho, et al.
Pubblicazione: (2026)

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

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
di: Hsieh, Jun-Ting, et al.
Pubblicazione: (2024)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
di: Mary, Arnaud
Pubblicazione: (2024)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
di: Cordasco, Gennaro, et al.
Pubblicazione: (2024)

An efficient uniqueness theorem for overcomplete tensor decomposition
di: Koiran, Pascal
Pubblicazione: (2024)

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

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

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
di: Dallard, Clément, et al.
Pubblicazione: (2024)

Distance Vector Domination
di: Cordasco, Gennaro, et al.
Pubblicazione: (2024)

Exact Algorithms for Edge Deletion to Cactus
di: Akhtar, Sheikh Shakil, et al.
Pubblicazione: (2026)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
di: Bedert, Benjamin, et al.
Pubblicazione: (2025)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
di: Hsieh, Jun-Ting, et al.
Pubblicazione: (2026)

An unconditional lower bound for the active-set method on the hypercube
di: Disser, Yann, et al.
Pubblicazione: (2025)

An unconditional lower bound for the active-set method in convex quadratic maximization
di: Bach, Eleon, et al.
Pubblicazione: (2025)

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

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

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
di: Lucke, Felicia, et al.
Pubblicazione: (2023)

On a tree-based variant of bandwidth and forbidding simple topological minors
di: Jacob, Hugo, et al.
Pubblicazione: (2025)

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

An $\mathcal{O}(n)$ Space Construction of Superpermutations
di: Ajmera, Dhruv
Pubblicazione: (2025)