Finding branch-decompositions of matroids, hypergraphs, and more

11/04/2017
by   Jisu Jeong, et al.
0

Given n subspaces of a finite-dimensional vector space over a fixed finite field F, we wish to find a "branch-decomposition" of these subspaces of width at most k, that is a subcubic tree T with n leaves mapped bijectively to the subspaces such that for every edge e of T, the sum of subspaces associated with leaves in one component of T-e and the sum of subspaces associated with leaves in the other component have the intersection of dimension at most k. This problem includes the problems of computing branch-width of F-represented matroids, rank-width of graphs, branch-width of hypergraphs, and carving-width of graphs. We present a fixed-parameter algorithm to construct such a branch-decomposition of width at most k, if it exists, for input subspaces of a finite-dimensional vector space over F. Our algorithm is analogous to the algorithm of Bodlaender and Kloks (1996) on tree-width of graphs. To extend their framework to branch-decompositions of vector spaces, we developed highly generic tools for branch-decompositions on vector spaces. The only known previous fixed-parameter algorithm for branch-width of F-represented matroids was due to Hliněný and Oum (2008) that runs in time O(n^3) where n is the number of elements of the input F-represented matroid. But their method is highly indirect. Their algorithm uses the non-trivial fact by Geelen et al. (2003) that the number of forbidden minors is finite and uses the algorithm of Hliněný (2005) on checking monadic second-order formulas on F-represented matroids of small branch-width. Our result does not depend on such a fact and is completely self-contained, and yet matches their asymptotic running time for each fixed k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2018

Fast Dynamic Programming on Graph Decompositions

In this paper, we consider tree decompositions, branch decompositions, a...
research
08/02/2018

Lean tree-cut decompositions: obstructions and algorithms

The notion of tree-cut width has been introduced by Wollan [The structur...
research
11/05/2021

Fast FPT-Approximation of Branchwidth

Branchwidth determines how graphs, and more generally, arbitrary connect...
research
02/27/2022

A logic-based algorithmic meta-theorem for mim-width

We introduce a logic called distance neighborhood logic with acyclicity ...
research
07/15/2020

Adapting the Directed Grid Theorem into an FPT Algorithm

The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the mo...
research
06/25/2023

Exploring two concepts: branch decomposition and weak ultrafilter on connectivity system

This paper explores two fundamental concepts: branch width and weak ultr...
research
01/25/2022

Safety and Completeness in Flow Decompositions for RNA Assembly

Decomposing a network flow into weighted paths has numerous applications...

Please sign up or login with your details

Forgot password? Click here to reset