The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
[article]
2012
arXiv
pre-print
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, Scott, and Seymour [2, 3, 4, 8, 9, 11]. In this work we introduce a new approach to computing these width measures on semi-complete digraphs, via degree orderings. Using the new technique we are able to reprove the main results of [2, 9] in a unified and significantly
arXiv:1210.5363v1
fatcat:etv4uiqbtfdhzhdv3cgefh7b5y