Browsing Bergen Open Research Archive by Author "Kwon, O-joung"
Now showing items 1-4 of 4
-
Classes of Intersection Digraphs with Good Algorithmic Properties
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2022)While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ... -
Classes of intersection digraphs with good algorithmic properties
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2023)While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ... -
A Unifying Framework for Characterizing and Computing Width Measures
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-joung (Journal article; Peer reviewed, 2022)Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, ... -
Well-partitioned chordal graphs
Ahn, Jungho; Jaffke, Lars; Kwon, O-joung; Lima, Paloma T. (Journal article; Peer reviewed, 2022)We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs. A connected graph G is a well-partitioned chordal graph if there exist a partition P ...