Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes
Published 2021 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes
Authors
Keywords
Augmented cubes, Connectivity, Interconnection networks, Internally disjoint Steiner trees, Generalized connectivity
Journal
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume 154, Issue -, Pages 42-53
Publisher
Elsevier BV
Online
2021-04-20
DOI
10.1016/j.jpdc.2021.04.004
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- The reliability analysis based on the generalized connectivity in balanced hypercubes
- (2021) Chao Wei et al. DISCRETE APPLIED MATHEMATICS
- Decomposition of augmented cubes into regular connected pancyclic subgraphs
- (2020) S.A. Kandekar et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- The 4-set tree connectivity of (n,k)-star networks
- (2020) Chunfang Li et al. THEORETICAL COMPUTER SCIENCE
- The κk-connectivity of line graphs
- (2020) Hengzhe Li et al. DISCRETE APPLIED MATHEMATICS
- The generalized 4-connectivity of hierarchical cubic networks
- (2020) Shu-Li Zhao et al. DISCRETE APPLIED MATHEMATICS
- Constructing Node-Independent Spanning Trees in Augmented Cubes
- (2020) Baolei Cheng et al. FUNDAMENTA INFORMATICAE
- Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity
- (2020) Qifan Zhang et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
- (2020) Guo Chen et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- The Generalized Connectivity of Bubble-Sort Star Graphs
- (2019) Shu-Li Zhao et al. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- (2019) Baolei Cheng et al. DISCRETE APPLIED MATHEMATICS
- The generalized 3-connectivity of some Regular Networks
- (2019) Shu-Li Zhao et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
- (2019) Xirong Xu et al. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
- The Generalized Three-Connectivity of Two Kinds of Cayley Graphs
- (2018) Shu-Li Zhao et al. COMPUTER JOURNAL
- Steiner tree packing number and tree connectivity
- (2018) Hengzhe Li et al. DISCRETE MATHEMATICS
- The optimal routing of augmented cubes
- (2018) Meirun Chen et al. INFORMATION PROCESSING LETTERS
- On two generalized connectivities of graphs
- (2018) Zemin Jin et al. Discussiones Mathematicae Graph Theory
- Constructing spanning trees in augmented cubes
- (2018) S.A. Mane et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Two kinds of generalized connectivity of dual cubes
- (2018) Shu-Li Zhao et al. DISCRETE APPLIED MATHEMATICS
- The generalized connectivity of alternating group graphs and (n,k)-star graphs
- (2018) Shu-Li Zhao et al. DISCRETE APPLIED MATHEMATICS
- How many triangles and quadrilaterals are there in an n-dimensional augmented cube?
- (2018) Qiang Dong et al. THEORETICAL COMPUTER SCIENCE
- The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles
- (2017) Shasha Li et al. GRAPHS AND COMBINATORICS
- Edge-independent spanning trees in augmented cubes
- (2017) Yan Wang et al. THEORETICAL COMPUTER SCIENCE
- An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem
- (2015) Chia-Wei Lee et al. IEEE TRANSACTIONS ON COMPUTERS
- On the difference of two generalized connectivities of a graph
- (2015) Yuefang Sun et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- A solution to a conjecture on the generalized connectivity of graphs
- (2015) Lily Chen et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Conditional edge-fault pancyclicity of augmented cubes
- (2013) Dongqin Cheng et al. THEORETICAL COMPUTER SCIENCE
- The internal Steiner tree problem: Hardness and approximations
- (2012) Chao-Wen Huang et al. JOURNAL OF COMPLEXITY
- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
- (2011) A. Aazami et al. ALGORITHMICA
- Ratcheting strain and simulation of 16MnR steel under uniaxial cyclic loading
- (2011) Chao Li et al. COMPUTATIONAL MATERIALS SCIENCE
- Note on the hardness of generalized connectivity
- (2011) Shasha Li et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Sharp bounds for the generalized connectivity κ3(G)
- (2010) Shasha Li et al. DISCRETE MATHEMATICS
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started