Cover Image

Branch-width of represented matroids in matrix multiplication time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Choi, Mujin, Korhonen, Tuukka, Oum, Sang-il
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Combinatorics 05B35(Primary), 05C85, 68R10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
by: Oum, Sang-il, et al.
Published: (2026)

Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)

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

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
by: Atherton, William, et al.
Published: (2024)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
by: Boros, Endre, et al.
Published: (2023)

Cops and Robbers on Multi-Layer Graphs
by: Enright, Jessica, et al.
Published: (2023)

Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
by: Kanté, Mamadou Mostapha, et al.
Published: (2021)

Zero-free regions of partition functions with applications to algorithms and graph limits
by: Regts, Guus
Published: (2015)

Reconfiguration of Independent Transversals
by: Buys, Pjotr, et al.
Published: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

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

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)

Obstructions to Erdős-Pósa Dualities for Minors
by: Paul, Christophe, et al.
Published: (2024)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

Reconstructing a graph from the distance matrix of its boundary
by: Cáceres, José, et al.
Published: (2024)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
by: Dahlmeier, J Niklas, et al.
Published: (2025)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

Tight complexity bounds for diagram commutativity verification
by: Malko, Artem, et al.
Published: (2025)

Solving the $106$ years old $3^k$ points problem with the clockwise-algorithm
by: Ripà, Marco
Published: (2024)

Extremal Trees With Prescribed Burning Numbers
by: Leong, Eugene Jun Tong, et al.
Published: (2025)

Colorful Minors
by: Protopapas, Evangelos, et al.
Published: (2025)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

A New Construction of the Vietoris-Rips Complex
by: Rieser, Antonio
Published: (2023)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Awesome graph parameters
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
by: Mühlenthaler, Moritz, et al.
Published: (2024)