Blar i Department of Informatics på emneord "pathwidth"
Viser treff 1-1 av 1
-
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, ...