Image de couverture de livre

Branch-width of connectivity functions is fixed-parameter tractable

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Korhonen, Tuukka, Oum, Sang-il
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Discrete Mathematics Combinatorics 05C85, 05B35, 05C75
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Branch-width of represented matroids in matrix multiplication time
par: Choi, Mujin, et autres
Publié: (2026)

Twin-width of subdivisions of multigraphs
par: Ahn, Jungho, et autres
Publié: (2023)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
par: Oum, Sang-il, et autres
Publié: (2026)

Tree independence number V. Walls and claws
par: Chudnovsky, Maria, et autres
Publié: (2025)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

Awesome graph parameters
par: Štorgel, Kenny Bešter, et autres
Publié: (2025)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
par: Jelínek, Vít, et autres
Publié: (2020)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
par: Dallard, Clément, et autres
Publié: (2024)

Excluding an induced wheel minor in graphs without large induced stars
par: Choi, Mujin, et autres
Publié: (2025)

Finding hypergraph immersion is fixed-parameter tractable
par: Meng, Xiangyi, et autres
Publié: (2024)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
par: Chudnovsky, Maria, et autres
Publié: (2024)

Pathographs and some (un)decidability results
par: Carter, Daniel, et autres
Publié: (2025)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
par: Bousquet, Nicolas, et autres
Publié: (2024)

$t$-sails and sparse hereditary classes of unbounded tree-width
par: Cocks, Daniel
Publié: (2023)

Conformality of Minimal Transversals of Maximal Cliques
par: Boros, Endre, et autres
Publié: (2024)

Isolation critical graphs under multiple edge subdivision
par: Bartolo, Karl, et autres
Publié: (2026)

Young domination on Hamming rectangles
par: Gravner, Janko, et autres
Publié: (2025)

A simple quadratic kernel for Token Jumping on surfaces
par: Cranston, Daniel W., et autres
Publié: (2024)

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
par: Baste, Julien, et autres
Publié: (2019)

The Complexity of Distance-$r$ Dominating Set Reconfiguration
par: Banerjee, Niranka, et autres
Publié: (2023)

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
par: Anil, Arun, et autres
Publié: (2023)

Colorful Minors
par: Protopapas, Evangelos, et autres
Publié: (2025)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
par: Milanič, Martin, et autres
Publié: (2024)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
par: Munaro, Andrea, et autres
Publié: (2022)

On the joint embedding property for cographs and trees
par: Carter, Daniel
Publié: (2024)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
par: Bonnet, Édouard, et autres
Publié: (2023)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2023)

Twin-width of random graphs
par: Ahn, Jungho, et autres
Publié: (2022)

Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
par: Chiu, Yung-Chung, et autres
Publié: (2021)

On Intersection Graphs of Graphs and Hypergraphs: A Survey
par: Naik, Ranjan N.
Publié: (2018)

The Upper Clique Transversal Problem
par: Milanič, Martin, et autres
Publié: (2023)

On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
par: Onofri, Elia
Publié: (2024)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

(Even hole, triangle)-free graphs revisited
par: Martins, Beatriz, et autres
Publié: (2026)

Characterizations of undirected 2-quasi best match graphs
par: Korchmaros, Annachiara, et autres
Publié: (2025)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
par: Hoang, Duc A.
Publié: (2022)

Graphs whose Eulerian trails have unique labels
par: Kim, Donggyu, et autres
Publié: (2026)

Ramsey-type $χ$-bounds for $χ$-bounded graph classes
par: Nguyen, Tung, et autres
Publié: (2026)