Image de couverture de livre

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	An, Shinwoo, Im, Seonghyuk, Kim, Seokbeom, Lee, Myounghwan
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
par: Chang, Yeonsu, et autres
Publié: (2023)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
par: Galby, Esther, et autres
Publié: (2025)

Largest common subgraph of two forests
par: Rautenbach, Dieter, et autres
Publié: (2024)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
par: Le, Hoang-Oanh, et autres
Publié: (2024)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Exact Algorithms for Edge Deletion to Cactus
par: Akhtar, Sheikh Shakil, et autres
Publié: (2026)

Clique-free t-matchings in degree-bounded graphs
par: Paluch, Katarzyna, et autres
Publié: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
par: Arkhipov, Pavel, et autres
Publié: (2024)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
par: Iwata, Satoru, et autres
Publié: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
par: Xiao, Chenglong, et autres
Publié: (2024)

Edge coloring of products of signed graphs
par: Janczewski, Robert, et autres
Publié: (2023)

Light Edge Fault Tolerant Graph Spanners
par: Bodwin, Greg, et autres
Publié: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
par: Davot, Tom, et autres
Publié: (2025)

Towards Transitive-free Digraphs
par: Abhinav, Ankit, et autres
Publié: (2025)

Efficient algorithms for the Potts model on small-set expanders
par: Carlson, Charles, et autres
Publié: (2020)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
par: Beisegel, Jesse, et autres
Publié: (2025)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2026)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Interval H-graphs : Recognition and forbidden obstructions
par: Müller, Haiko, et autres
Publié: (2025)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
par: Gutekunst, Samuel C.
Publié: (2025)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
par: Korhonen, Tuukka, et autres
Publié: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
par: Bernshteyn, Anton, et autres
Publié: (2024)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

Enumerating minimal solution sets for metric graph problems
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
par: Lau, Lap Chi, et autres
Publié: (2024)

Holey graphs: very large Betti numbers are testable
par: Szabó, Dániel, et autres
Publié: (2024)

Designing sparse temporal graphs satisfying connectivity requirements
par: Bellitto, Thomas, et autres
Publié: (2026)

Generating minimal redundant and maximal irredundant sets in incidence graphs
par: Castelo, Emanuel, et autres
Publié: (2026)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

Tree Independence Number IV. Even-hole-free Graphs
par: Chudnovsky, Maria, et autres
Publié: (2024)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
par: Bonamy, Marthe, et autres
Publié: (2020)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
par: d'Orsi, Tommaso, et autres
Publié: (2024)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
par: Majewski, Konrad, et autres
Publié: (2022)

A characterization of testable hypergraph properties
par: Joos, Felix, et autres
Publié: (2017)

Strong spatial mixing for colorings on trees and its algorithmic applications
par: Chen, Zongchen, et autres
Publié: (2023)