Abstract: In this talk I try to give insight into one of the combinatorial problems that arose during my research: does the feedback arc set problem have a polynomial-time algorithm for the restricted input of some special digraphs on surfaces? After explaining the problem itself I spend some time on its origins in contact topology, and finisch by explaining the algorithm for graphs on surfaces with low genus.
The feedback arc set problem on some surface graphs
16.01.2024 15:15 - 16:45
Organiser:
M. Schlosser, I. Fischer
Location: