| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10151234 | Discrete Applied Mathematics | 2018 | 12 Pages |
Abstract
The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize the graphs of maximum matching width at most 2 using the minor obstruction set. Also, we compute the exact value of the maximum matching width of a grid.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jisu Jeong, Seongmin Ok, Geewon Suh,