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

Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees

โœ Scribed by Toshimitsu Masuzawa; Ken'ichi Hagihara; Nobuki Tokura; Koichi Wada

Book ID
112205504
Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
732 KB
Volume
17
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast Algorithms for k-Shredders and k-No
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
โœ Joseph Cheriyan; Ramakrishna Thurimella ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 321 KB

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.

Local search algorithms for the k-cardin
Local search algorithms for the k-cardinality tree problem
โœ Christian Blum; Matthias Ehrgott ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th