Triangle partition on graphs of bounded cutwidth
: upper- and lower bounds on algorithmic and communication complexity

  • I. van Heck

Student thesis: Master

Abstract

Date of Award31 Aug 2018
Original languageEnglish
SupervisorBart M.P. Jansen (Supervisor 1) & Jesper Nederlof (Supervisor 2)

Cite this

'