Node‐disjoint paths and related problems on hierarchical cubic networks
From MaRDI portal
Publication:4785230
DOI10.1002/net.10040zbMath1064.68012OpenAlexW2065410746MaRDI QIDQ4785230
Gen-Huey Chen, Jung-Sheng Fu, Dyi-Rong Duh
Publication date: 17 December 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10040
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Node-disjoint paths in hierarchical hypercube networks, Node-disjoint paths in a level block of generalized hierarchical completely connected networks, On conditional fault tolerance and diagnosability of hierarchical cubic networks, One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes, The generalized 4-connectivity of hierarchical cubic networks, On conditional fault tolerance of hierarchical cubic networks, Constructing vertex-disjoint paths in \((n, k)\)-star graphs, \(\omega \)-wide diameters of enhanced pyramid networks, On \(g\)-extra conditional diagnosability of hierarchical cubic networks, Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs