Skip to main content

3 Result(s)

within Sang-il Oum Remove this filter English Remove this filter Data Structures Remove this filter Numeric Computing 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)

  2. No Access

    Chapter and Conference Paper

    Finding Branch-Decompositions and Rank-Decompositions

    We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outpu...

    Petr Hliněný, Sang-il Oum in Algorithms – ESA 2007 (2007)

  3. No Access

    Chapter and Conference Paper

    Approximating Rank-Width and Clique-Width Quickly

    Rank-width is defined by Seymour and the author to investigate clique-width; they show that graphs have bounded rank-width if and only if they have bounded clique-width. It is known that many hard graph proble...

    Sang-il Oum in Graph-Theoretic Concepts in Computer Science (2005)