Blar i Department of Informatics på emneord "cutwidth"
Viser treff 1-2 av 2
-
Arrangement Problems Parameterized by Neighbourhood Diversity
(Master thesis, 2018-12-19)We show that the arrangement problems BANDWIDTH, DISTORTION and IMBALANCE is FPT when parameterized by neighbourhood diversity, and establish some structural results for CUTWIDTH parameterized by neighbourhood diversity. -
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
(Peer reviewed; Journal article, 2013)The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ...