Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
An FPT algorithm for cycle rank on semi-complete digraphs
Seokbeom Kim, O-joung Kwon, Myounghwan Lee
Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determi…
cs.DS2024
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
Shinwoo An, Yeonsu Chang, Kyungjin Cho +4
Horiyama et al. (AAAI 2024) considered the problem of generating instances with a unique minimum vertex cover under certain conditions. The Minimum Pre-assignment for Uniquificatio…
cs.DS2023
A new width parameter of graphs based on edge cuts: -edge-crossing width
Yeonsu Chang, O-joung Kwon, Myounghwan Lee
We introduce graph width parameters, called -edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decompos…