Posts Tagged ‘권오정’

O-joung Kwon (권오정), Erdős-Pósa property of chordless cycles and its applications

Monday, January 1st, 2018
Erdős-Pósa property of chordless cycles and its applications
O-joung Kwon (권오정)
Technische Universität Berlin, Berlin, Germany
2018/1/12 Fri 4PM-5PM
A chordless cycle in a graph G is an induced subgraph of G which is a cycle of length at least four. We prove that the Erdős-Pósa property holds for chordless cycles, which resolves the major open question concerning the Erdős-Pósa property. Our proof for chordless cycles is constructive: in polynomial time, one can find either k+1 vertex-disjoint chordless cycles, or ck2 log k vertices hitting every chordless cycle for some constant c. It immediately implies an approximation algorithm of factor O(OPT log OPT) for Chordal Vertex Deletion. We complement our main result by showing that chordless cycles of length at least ℓ for any fixed ℓ≥ 5 do not have the Erdős-Pósa property.

O-joung Kwon (권오정), On low rank-width colorings

Sunday, May 14th, 2017
On low rank-width colorings
O-joung Kwon (권오정)
Technische Universitat Berlin, Berin, Germany
2017/6/09 Friday 11AM
We introduce the concept of low rank-width colorings, generalizing the notion of low tree-depth colorings introduced by Nešetřil and Ossona de Mendez in [Grad and classes with bounded expansion I. Decompositions. EJC 2008]. We say that a class 𝓒 of graphs admits low rank-width colorings if there exist functions N:ℕ→ℕ and Q:ℕ→ℕ such that for all p∈ℕ, every graph G∈𝓒 can be vertex colored with at most N(p) colors such that the union of any i≤p color classes induces a subgraph of rank-width at most Q(i).
Graph classes admitting low rank-width colorings strictly generalize graph classes admitting low tree-depth colorings and graph classes of bounded rank-width. We prove that for every graph class 𝓒 of bounded expansion and every positive integer r, the class {Gr: G∈𝓒} of r-th powers of graphs from 𝓒, as well as the classes of unit interval graphs and bipartite permutation graphs admit low rank-width colorings. All of these classes have unbounded rank-width and do not admit low tree-depth colorings. We also show that the classes of interval graphs and permutation graphs do not admit low rank-width colorings. In this talk, we provide the color refinement technique necessary to show the first result. This is joint work with Sebastian Sierbertz and Michał Pilipczuk.

O-joung Kwon (권오정), Generalized feedback vertex set problems on bounded-treewidth graphs

Wednesday, October 19th, 2016
Generalized feedback vertex set problems on bounded-treewidth graphs
O-joung Kwon (권오정)
Technische Universitat Berlin, Berin, Germany
2016/11/25 Fri 4PM-5PM
It has long been known that Feedback Vertex Set can be solved in time 2O(w log w)nO(1) on graphs of treewidth w, but it was only recently that this running time was improved to 2O(w)nO(1), that is, to single-exponential parameterized by treewidth. We consider a natural generalization of this problem, which asks given a graph G on n vertices and positive integers k and d, whether there is a set S of at most k vertices of G such that each block of G-S has at most d vertices. The central question of this talk is: “Can we obtain an algorithm that runs in single-exponential time parameterized by treewidth, for every fixed d?” The answer is negative. But then, one may be curious which properties of Feedback Vertex Set that make it allow to have a single-exponential algorithm. To answer this question, we add an additional condition in the general problem, and provide a dichotomy result.
Formally, for a class 𝒫 of graphs, the Bounded 𝒫-Block Vertex Deletion problem asks, given a graph G on n vertices and positive integers k and d, whether there is a set S of at most k vertices of G such that each block of G-S has at most d vertices and is in 𝒫. Assuming that 𝒫 is recognizable in polynomial time and satisfies a certain natural hereditary condition, we give a sharp characterization of when single-exponential parameterized algorithms are possible for fixed values of d:

  • if 𝒫 consists only of chordal graphs, then the problem can be solved in time 2O(wd^2)nO(1),
  • if 𝒫 contains a graph with an induced cycle of length ℓ≥4, then the problem is not solvable in time 2o(w log w) nO(1) even for fixed d=ℓ, unless the ETH fails.

We further show that it is W[1]-hard parameterized by only treewidth, when 𝒫 consists of all graphs. This is joint work with Édouard Bonnet, Nick Brettell, and Daniel Marx.

O-Joung Kwon, Upper bounds on the size of obstructions for graphs of linear rank-width at most k

Monday, November 17th, 2014
Upper bounds on the size of obstructions for graphs of linear rank-width at most k
2014/12/02 Tuesday 4PM-5PM
Room 1409
Graph layout problems are a class of optimization problems whose goal is to find a linear ordering of an input graph in such a way that a certain objective function is optimized. The matrix rank function has been studied as an objective function. The linear rank-width of a graph G is the minimum integer k such that G admits a linear ordering \(v_1, v_2, \ldots , v_n\) satisfying that the maximum over all values $$ \operatorname{rank}A_G[\{v_1, v_2, \ldots, v_t\}, \{v_{t+1}, \ldots, v_n\}]$$ is k, where \(A_G\) is the adjacency matrix of G and the rank is computed over the binary field.

In this talk, we present a result that for every graph G that is vertex-minor minimal with the property having linear rank-width larger than p, the number of vertices in G is at most doubly exponential in \(\mathcal{O}(p)\). The number of vertex-minor obstructions for linear rank-width at most p is of interest because the only known fixed parameter tractable algorithm to test whether linear rank-width is at most p is using the finiteness of the number of forbidden vertex-minor obstructions. Our result gives an upper bound of the complexity on this algorithm. Our basic tools are the algebraic operations on labelled graphs introduced by Kanté and Rao, and we extend the notion of vertex-minors in our purpose. This is joint work with Mamadou Moustapha Kanté.

O-Joung Kwon (권오정), Unavoidable vertex-minors in large prime graphs. (FRIDAY)

Wednesday, September 4th, 2013
Unavoidable vertex-minors in large prime graphs
O-joung Kwon
Department of Mathematical Sciences
KAIST
2013/10/04 Friday 4PM-5PM
ROOM 1409
A split of a graph is a partition (A,B) of the vertex set V(G) having subsets A0 of A and B0 of B such that |A|,|B| > 1 and a vertex a in A is adjacent to a vertex b in B if and only if a is in A0 and b is in B0. A graph is prime (with respect to the split decomposition) if it has no split.

We prove that for each n, there exists N such that every prime graph on at least N vertices contains a vertex-minor isomorphic to either a cycle of length n or a graph consisting of two disjoint cliques of size n joined by a matching.

In this talk, we plan to describe a main tool, which is called a blocking sequence in a prime graph, and we will describe two big steps of the proof. And we will pose some open problems behind this result.

This is a joint work with Sang-il Oum.