A polynomial algorithm for computing the weak rupture degree of trees

被引：0

作者：

Wei, Zongtian ^{[1
]}

Yue, Chao ^{[1
]}

Li, Yinkui ^{[2
]}

Yue, Hongyun ^{[1
]}

Liu, Yong ^{[1
]}

机构：

[1] Xian Univ Architecture & Technol, Sch Sci, Xian 710055, Shaanxi, Peoples R China

[2] Qinghai Nationalities Univ, Sch Math & Stat, Xining 810000, Qinghai, Peoples R China

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2019年 / 361卷

基金：

中国国家自然科学基金;

关键词：

Graph; Weak rupture degree; Tree; Algorithm; Complexity;

D O I：

10.1016/j.amc.2019.06.019

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G = (V, E) be a graph. The weak rupture degree of G is defined as r(w) (G) = max{omega(G -X - vertical bar X vertical bar - m(e) (G -X) : omega(G - X) > 1}, where the maximum is taken over all X, the subset of V(G), omega(G - X) is the number of components in G - X, and m(e) (G - X) is the size (edge number) of a largest component in G - X. This is an important parameter to quantitatively describe the invulnerability of networks. In this paper, based on a study of relationship between network structure and the weak rupture degree, a polynomial algorithm for computing the weak rupture degree of trees is given. (C) 2019 Elsevier Inc. All rights reserved.

引用

页码：730 / 734

页数：5

共 50 条

[11] Computing Optimal Steiner Trees in Polynomial Space
Fedor V. Fomin
Fabrizio Grandoni
Dieter Kratsch
Daniel Lokshtanov
Saket Saurabh
[J]. Algorithmica, 2013, 65 : 584 - 604
[12] A POLYNOMIAL-TIME ALGORITHM FOR FINDING A LARGEST COMMON SUBGRAPH OF ALMOST TREES OF BOUNDED DEGREE
AKUTSU, T
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1993, E76A (09) : 1488 - 1493
[13] Decomposable trees: a polynomial algorithm for tripodes
Barth, D
Baudon, O
Puech, J
[J]. DISCRETE APPLIED MATHEMATICS, 2002, 119 (03) : 205 - 216
[14] A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
Akutsu, Tatsuya
Tamura, Takeyuki
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 76 - 87
[15] Algorithm for Computing the Truncation of the Discriminant of a Polynomial
Lyapin, A. P.
Mikhalkin, E. N.
[J]. PROGRAMMING AND COMPUTER SOFTWARE, 2023, 49 (01) : 49 - 53
[16] AN ALGORITHM FOR COMPUTING THE ROOTS OF A COMPLEX POLYNOMIAL
AURAND, JF
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1987, 32 (02) : 164 - 166
[17] Algorithm for Computing the Truncation of the Discriminant of a Polynomial
A. P. Lyapin
E. N. Mikhalkin
[J]. Programming and Computer Software, 2023, 49 : 49 - 53
[18] A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
Yao, Guohui
Zhu, Daming
Li, Hengwu
Ma, Shaohan
[J]. DISCRETE MATHEMATICS, 2008, 308 (17) : 3951 - 3959
[19] Computing the maximal canonical form for trees in polynomial time
Gunnar Brinkmann
[J]. Journal of Mathematical Chemistry, 2018, 56 : 1437 - 1444
[20] Computing the maximal canonical form for trees in polynomial time
Brinkmann, Gunnar
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2018, 56 (05) : 1437 - 1444

← 1 2 3 4 5 →