4.5 Article

Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Mathematics, Applied

The generalized 4-connectivity of hierarchical cubic networks

Shu-Li Zhao et al.

Summary: This paper focuses on the generalized 4-connectivity of the hierarchical cubic network HCNn and shows that kappa(4)(HCNn) = n for n >= 3. As a corollary, it is also obtained that kappa(3)(HCNn) = n for n >= 3.

DISCRETE APPLIED MATHEMATICS (2021)

Article Computer Science, Theory & Methods

Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity

Qifan Zhang et al.

Summary: The paper focuses on the determination of h-extra edge-connectivity and r-component edge-connectivity of n-dimensional augmented cubes with specific conditions. The study provides insights into the reliability evaluation of interconnection networks based on these parameters.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2021)

Article Mathematics, Applied

The reliability analysis based on the generalized connectivity in balanced hypercubes

Chao Wei et al.

Summary: The paper explores recent advances in network connectivity analysis with a focus on a more accurate method for evaluating connectivity among network nodes. By studying the generalized k-connectivity problem, it is proven that the n-dimensional balanced hypercube has specific connectivity characteristics.

DISCRETE APPLIED MATHEMATICS (2021)

Article Computer Science, Theory & Methods

Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube

Guo Chen et al.

Summary: This article discusses the importance and applications of constructing Completely Independent Spanning Trees (CISTs) in a network, especially in data center networks. It also introduces the augmented cube AQn as the underlying structure of a data center network and studies how to construct n-1 optimal CISTs in its logic graph L-AQDNn. Additionally, the relationship between the dimension of a hypercube-family network and the number of CISTs it can host is established for the first time.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2021)

Article Mathematics, Applied

An improved algorithm to construct edge-independent spanning trees in augmented cubes

Baolei Cheng et al.

DISCRETE APPLIED MATHEMATICS (2020)

Article Computer Science, Theory & Methods

Decomposition of augmented cubes into regular connected pancyclic subgraphs

S. A. Kandekar et al.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2020)

Article Mathematics, Applied

The κk-connectivity of line graphs

Hengzhe Li et al.

DISCRETE APPLIED MATHEMATICS (2020)

Article Computer Science, Theory & Methods

The 4-set tree connectivity of (n, k)-star networks

Chunfang Li et al.

THEORETICAL COMPUTER SCIENCE (2020)

Article Computer Science, Software Engineering

Constructing Node-Independent Spanning Trees in Augmented Cubes

Baolei Cheng et al.

FUNDAMENTA INFORMATICAE (2020)

Article Computer Science, Hardware & Architecture

The Generalized Three-Connectivity of Two Kinds of Cayley Graphs

Shu-Li Zhao et al.

COMPUTER JOURNAL (2019)

Review Mathematics, Applied

The generalized connectivity of the line graph and the total graph for the complete bipartite graph

Yinkui Li et al.

APPLIED MATHEMATICS AND COMPUTATION (2019)

Article Mathematics, Applied

The generalized 4-connectivity of exchanged hypercubes

Shu-Li Zhao et al.

APPLIED MATHEMATICS AND COMPUTATION (2019)

Article Computer Science, Theory & Methods

The Generalized Connectivity of Bubble-Sort Star Graphs

Shu-Li Zhao et al.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2019)

Article Computer Science, Theory & Methods

The generalized 3-connectivity of some Regular Networks

Shu-Li Zhao et al.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2019)

Article Mathematics, Applied

Two kinds of generalized connectivity of dual cubes

Shu-Li Zhao et al.

DISCRETE APPLIED MATHEMATICS (2019)

Article Computer Science, Theory & Methods

Fault-Tolerant Panconnectivity of Augmented Cubes AQn

Xirong Xu et al.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2019)

Article Computer Science, Theory & Methods

How many triangles and quadrilaterals are there in an n-dimensional augmented cube?

Qiang Dong et al.

THEORETICAL COMPUTER SCIENCE (2019)

Article Mathematics

Steiner tree packing number and tree connectivity

Hengzhe Li et al.

DISCRETE MATHEMATICS (2018)

Article Computer Science, Information Systems

The optimal routing of augmented cubes

Meirun Chen et al.

INFORMATION PROCESSING LETTERS (2018)

Article Mathematics

ON TWO GENERALIZED CONNECTIVITIES OF GRAPHS

Yuefang Sun et al.

DISCUSSIONES MATHEMATICAE GRAPH THEORY (2018)

Article Mathematics, Applied

The λ3-connectivity and κ3-connectivity of recursive circulants

Hengzhe Li et al.

APPLIED MATHEMATICS AND COMPUTATION (2018)

Article Computer Science, Theory & Methods

Constructing spanning trees in augmented cubes

S. A. Mane et al.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2018)

Article Mathematics, Applied

The generalized connectivity of alternating group graphs and (n, k)-star graphs

Shu-Li Zhao et al.

DISCRETE APPLIED MATHEMATICS (2018)

Article Computer Science, Interdisciplinary Applications

On the difference of two generalized connectivities of a graph

Yuefang Sun et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)

Article Computer Science, Interdisciplinary Applications

A solution to a conjecture on the generalized connectivity of graphs

Lily Chen et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)

Article Computer Science, Theory & Methods

Edge-independent spanning trees in augmented cubes

Yan Wang et al.

THEORETICAL COMPUTER SCIENCE (2017)

Article Mathematics, Applied

The generalized 4-connectivity of hypercubes

Shangwei Lin et al.

DISCRETE APPLIED MATHEMATICS (2017)

Article Mathematics, Applied

The generalized 3-connectivity of star graphs and bubble-sort graphs

Shasha Li et al.

APPLIED MATHEMATICS AND COMPUTATION (2016)

Article Computer Science, Hardware & Architecture

An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem

Chia-Wei Lee et al.

IEEE TRANSACTIONS ON COMPUTERS (2015)

Article Mathematics, Applied

An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2

Chia-Chen Wei et al.

JOURNAL OF DISCRETE ALGORITHMS (2015)

Article Computer Science, Theory & Methods

The internal Steiner tree problem: Hardness and approximations

Chao-Wen Huang et al.

JOURNAL OF COMPLEXITY (2013)

Article Computer Science, Theory & Methods

Conditional edge-fault pancyclicity of augmented cubes

Dongqin Cheng et al.

THEORETICAL COMPUTER SCIENCE (2013)

Article Computer Science, Software Engineering

Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

A. Aazami et al.

ALGORITHMICA (2012)

Article Computer Science, Interdisciplinary Applications

Note on the hardness of generalized connectivity

Shasha Li et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2012)

Article Mathematics

Sharp bounds for the generalized connectivity κ3(G)

Shasha Li et al.

DISCRETE MATHEMATICS (2010)

Article Mathematics, Applied

Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes

Hung-Chang Chan et al.

APPLIED MATHEMATICS AND COMPUTATION (2009)

Article Computer Science, Theory & Methods

Packing Element-Disjoint Steiner Trees

Joseph Cheriyan et al.

ACM TRANSACTIONS ON ALGORITHMS (2007)

Article Computer Science, Theory & Methods

Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes

Meijie Ma et al.

PARALLEL COMPUTING (2007)

Article Computer Science, Hardware & Architecture

Augmented cubes

SA Choudum et al.

NETWORKS (2002)