Skip to main content

8 Result(s)

within Yuejuan Han Remove this filter

and

  1. No Access

    Article

    Connectivity and diagnosability of a class of recursive networks

    With the expansion of network scale, it is essential to study network reliability through connectivity and diagnosability. For Hypercube, DCell, BCube, and other networks, their connection modes are specific a...

    Yaqian Tang, Baolei Cheng, Yan Wang, Yuejuan Han, Jia Yu… in The Journal of Supercomputing (2024)

  2. No Access

    Article

    Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication

    If a set of spanning trees of a graph do not share any edge with each other, they are called edge-disjoint spanning trees (for short EDSTs), which have widespread practical applications, such as fault-tolerant...

    Huanwen Zhang, Yan Wang, Jianxi Fan, Yuejuan Han… in The Journal of Supercomputing (2024)

  3. No Access

    Chapter and Conference Paper

    Hamiltonian Properties of the Dragonfly Network

    The dragonfly network is a hierarchical network with a low diameter and high throughput, which uses a set of high-cardinality routers to increase the effective cardinality of the network. The Hamiltonian prope...

    Suying Wu, Baolei Cheng, Yan Wang… in New Trends in Computer Technologies and Ap… (2022)

  4. No Access

    Chapter and Conference Paper

    Embedding Augmented Cubes into Grid Networks for Minimum Wirelength

    Deriving an effective VLSI layout for interconnected network is important, since it increases the cost-effectiveness of parallel architectures. Graph embedding is the key to solving the problems of parallel st...

    **g**g **a, Yan Wang, Jianxi Fan… in Algorithms and Architectures for Parallel … (2020)

  5. No Access

    Chapter and Conference Paper

    Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks

    Node/edge-Independent spanning trees (ISTs) have attracted a lot of attention in the past twenty years. Many results such as edge-disjoint Hamilton cycles, traceability, number of spanning trees, structural pr...

    Baolei Cheng, Jianxi Fan, **aoyan Li… in Algorithms and Architectures for Parallel … (2018)

  6. No Access

    Chapter and Conference Paper

    Reliability Evaluation of DCell Networks

    Recently, the reliability evaluation of data center network (DCN) is important to the design and operation of DCNs. Extra connectivity determination and faulty networks structure analysis are two significant a...

    ** Wang, Funan He, Yuejuan Han, Lantao You in Advanced Hybrid Information Processing (2018)

  7. No Access

    Chapter and Conference Paper

    One-to-One Disjoint Path Covers on Mesh

    We propose a new definition to describe the characteristics of a graph. A graph G is strong \(k^*\) -connect...

    Manyi Du, Jianxi Fan, Yuejuan Han… in Algorithms and Architectures for Parallel … (2015)

  8. No Access

    Chapter and Conference Paper

    An Algorithm to Embed a Family of Node-Disjoint 3D Meshes into Locally Twisted Cubes

    In this paper, embeddings of a family of 3D meshes in locally twisted cubes are studied. Let LTQ n (V, E) denotes the n-dimensional locally twisted cube. We find two m...

    Lantao You, Yuejuan Han in Algorithms and Architectures for Parallel Processing (2014)