Skip to main content

1 Result(s)

within English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Algorithms Remove this filter Computation by Abstract Devices Remove this filter Data Structures Remove this filter Sang-il Oum Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    An FPT 2-Approximation for Tree-cut Decomposition

    The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47–66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequa...

    Eunjung Kim, Sang-il Oum, Christophe Paul… in Approximation and Online Algorithms (2015)