The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the problem Min-DESC, we are given a digraph D and an integer k, and asked whether there exists a set A′ of at most k arcs in D, such that if we remove the arcs of A′, in the resulting digraph every strong component is Eulerian. Min-DESC is NP-hard; Cechlárová and Schlotter (IPEC 2010) asked whether the problem is fixed-parameter tractable when parameterized by k. We consider the subproblem of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.