
This research paper investigates the complexity of partitioning semicomplete digraphs. A 2-partition divides the vertices of a digraph into two non-empty sets. The study focuses on determining if such partitions can satisfy specific properties within each subset, particularly concerning minimum out-degree, minimum in-degree, or minimum semi-degree. The paper builds upon previous work that analyzed these problems for general digraphs, many of which were found to be NP-complete. This research explores whether these problems remain NP-complete for the more structured class of semicomplete digraphs. Key findings include identifying conditions under which these 2-partition problems are NP-complete for semicomplete digraphs. Conversely, the paper also presents algorithms that efficiently solve certain 2-partition problems for semicomplete digraphs with bounded independence numbers or specific degree constraints. These results contribute to a deeper understanding of the computational complexity of graph partitioning problems in specific graph classes.
The provided fee information is for full-degree students starting in September 2026 or later. Tuition fees may vary by faculty. This specific program's fee is extrapolated from the Faculty of Science rate. Non EU/EEA students typically pay tuition fees.
For non-EU/EEA students, the tuition fee is EUR 17,300 per year, applicable to Faculty of Science programs starting September 2026 or later.
The tuition fee information is for full-degree students starting in September 2026 or later, and non-EU/EEA students typically pay tuition fees. This specific program's fee is extrapolated from the Faculty of Science rate.
The provided information does not specify the program's duration.
As this appears to be a research publication rather than a taught program, standard program entry requirements are not applicable. For research opportunities, contacting faculty members in relevant departments is recommended.
This document is a research publication. For information on pursuing research or studies at the University of Southern Denmark, please refer to the general admissions information for degree programs.
Research in areas like graph theory and computer science can lead to careers in academia, research and development, and specialized IT roles.