๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

โœ Scribed by Joseph Cheriyan; Ramakrishna Thurimella

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
321 KB
Volume
33
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 ลฝ 2 2 3 1.5 . ลฝ . present an O k n q k n -time deterministic algorithm for finding all the k-shredders. This solves an open question: efficiently find a k-separator whose removal maximizes the number of connected components. For k G 4, our running time is within a factor of k of the fastest algorithm known for testing k-node connectivity. One application of shredders is to increase the node connectivity from ลฝ . ลฝ . k to k q 1 by efficiently adding an approximately minimum number of new ลฝ . ลฝ 5 . edges.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for construction of a k-con
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
โœ Ulrich Schumacher ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

k-Space weighted least-squares algorithm
k-Space weighted least-squares algorithm for accurate and fast motion extraction from magnetic resonance navigator echoes
โœ Thanh D. Nguyen; Yi Wang; Richard Watts; Ian Mitchell ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 191 KB

## Abstract Navigator echoes provide an effective method to monitor physiological motion, allowing motion artifacts to be suppressed by modifying the data acquisition accordingly. The displacement can be measured directly from the navigator phase using an algorithm suggested by Ahn and Cho (IEEE Tr

A fast algorithm for a k-NN classifier b
A fast algorithm for a k-NN classifier based on the branch and bound method and computational quantity estimation
โœ Shin'ichiro Omachi; Hirotomo Aso ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB ๐Ÿ‘ 3 views

The nearest neighbor rule or k-nearest neighbor rule is a technique of nonparametric pattern recognition. Its algorithm is simple and the error is smaller than twice the Bayes error if there are enough training samples. However, it requires an enormous amount of computation, proportional to the numb