Skip to main content

8 Result(s)

within Sang-il Oum Remove this filter English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. 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)

  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

    Deciding First Order Properties of Matroids

    Frick and Grohe [J. ACM 48 (2006), 1184–1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order property can be decided in almost linear time in such a...

    Tomáš Gavenčiak, Daniel Král, Sang-il Oum in Automata, Languages, and Programming (2012)

  4. No Access

    Chapter and Conference Paper

    Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

    We prove a general duality theorem for width parameters in combinatorial structures such as graphs and matroids. It implies the classical such theorems for path-width, tree-width, branch-width and rank-width, ...

    Reinhard Diestel, Sang-il Oum in Graph-Theoretic Concepts in Computer Science (2014)

  5. 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)

  6. No Access

    Article

    An FPT 2-Approximation for Tree-Cut Decomposition

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

    Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau… in Algorithmica (2018)

  7. No Access

    Chapter and Conference Paper

    Computing Small Pivot-Minors

    A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. However, so fa...

    Konrad K. Dabrowski, François Dross… in Graph-Theoretic Concepts in Computer Scien… (2018)

  8. No Access

    Article

    A Polynomial Kernel for 3-Leaf Power Deletion

    For a non-negative integer \(\ell \) ℓ , the

    Jungho Ahn, Eduard Eiben, O.-joung Kwon, Sang-il Oum in Algorithmica (2023)