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 k-separator (k-shredder) of a k-node connected undirected graph is a set of k nodes whose removal results in two or more (three or more) connected components. Let n denote the number of nodes. Solving an open question, we show that the problem of counting the number of k-separators is #P-complete. However, we present an O(k 2 n 2 +k 3 n 1.5 )-time (deterministic)...
Acertificatefor thekconnectivity (kconnectivity refers to bothk-edge connectivity andk-vertex connectivity unless explicitly stated otherwise) of a graphG=(V,E) is a subsetE′ ofEsuch that (V,E′) iskconnected iffGiskconnected. Letn=|V| andm=|E|. A certificate is calledsparseif it has sizeO(kn). We present a distributed algorithm for computing a sparse certificate forkconnectivity. Letf(n) andg(n) be...
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.