Skip navigation

Main Menu

Global Menu

Activities

Search

Publication

Publication

tab menu

  • View
  • All
  • Mathematics
  • Physics
  • Computational Sciences
  • Center for Advanced Computation

Seminar View

Seminar
TITLE Characterizing graphs of maximum matching width at most 2
KIAS AUTHORS Ok, Seongmin
JOURNAL DISCRETE APPLIED MATHEMATICS, 2018
ARCHIVE arXiv:1606.07157
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. (C) 2017 Elsevier B.V. All rights reserved.
  • before page
  • list
  • next page
Seminar List

keyword

fiel&date

~