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.
A cyclic edge cutset is an edge cutset whose deletion disconnects the graph such that two of the components contain a cycle respectively. The cyclic edge connectivity clambda(G) is the minimum cardinality of all the cyclic edge cutsets of G. There is no polynomial time algorithm to determine the cyclic edge connectivity of a graph. In this paper,we develop a polynomial time algorithm to determine...
A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses. The renamable Horn problem is solvable in linear time, but the maximum renamable Horn problem (MAX-RHS) is NP-hard. In this paper, we present transformations between clause sets and undirected graphs in polynomial time, such that finding a renamable Horn subset of a clause...
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.