19 citations · 50 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017★ 10 cited
Finding branch-decompositions of matroids, hypergraphs, and more
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Given subspaces of a finite-dimensional vector space over a fixed finite field , we wish to find a "branch-decomposition" of these subspaces of width at most tha…
cs.DM2017
Computing the maximum matching width is NP-hard
Kwangjun Ahn, Jisu Jeong
The maximum matching width is a graph width parameter that is defined on a branch-decomposition over the vertex set of a graph. In this short paper, we prove that the problem of co…