2 Result(s)
within
English
Algorithm Analysis and Problem Complexity
Algorithms
Data Structures
Sang-il Oum
Conference Paper
-
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...
-
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, ...
