Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
Authors:
- Shu-Li ZhaoSZShu-Li Zhao
- Jou-Ming ChangJou-Ming Chang
- 8 December 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 943, 1-15
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Science and Technology, Taiwan (MOST111-2221-E-141-006)
- National Natural Science Foundation of China (12101203)
- China Postdoctoral Science Foundation (2022M711075)
This publication has 27 references indexed in Scilit:
- Generalized Connectivity of Graphs2016
- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal NodesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016
- An Improved Approximation Ratio to the Partial-Terminal Steiner Tree ProblemIEEE Transactions on Computers, 2013
- The internal Steiner tree problem: Hardness and approximationsJournal of Complexity, 2013
- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar GraphsAlgorithmica, 2011
- Note on the hardness of generalized connectivityJournal of Combinatorial Optimization, 2011
- Sharp bounds for the generalized connectivityDiscrete Mathematics, 2010
- Packing element-disjoint steiner treesACM Transactions on Algorithms, 2007
- Pendant tree-connectivityJournal of Combinatorial Theory, Series B, 1985
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932