Disjoint path covers with path length constraints in restricted hypercube-like graphs
From MaRDI portal
Publication:2402363
DOI10.1016/j.jcss.2017.05.007zbMath1372.68215OpenAlexW2617310522MaRDI QIDQ2402363
Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park
Publication date: 7 September 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.05.007
fault toleranceinterconnection networkpath partitionhypercube-like graphdisjoint path coverprescribed path lengthsprescribed sources
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for finding disjoint path covers in unit interval graphs
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- Generalized Gray codes with prescribed ends
- Efficient unicast in bijective connection networks with the restricted faulty node set
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
- On the generalized twisted cube
- Many-to-many disjoint paths in faulty hypercubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- An efficient algorithm to construct disjoint path covers of DCell networks
- Ore-type degree conditions for disjoint path covers in simple graphs
- Linear algorithm for optimal path cover problem on interval graphs
- The two-equal-disjoint path cover problem of matching composition network
- Path partitions of hypercubes
- Optimal path cover problem on block graphs and bipartite permutation graphs
- Recursive circulants and their embeddings among hypercubes
- Counting structures in the Möbius ladder
- An optimal path cover algorithm for cographs
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- Paired many-to-many disjoint path covers of the hypercubes
- Disjoint path covers in cubes of connected graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Embedding $m$-quasistars into $n$-cubes
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
- Disjoint paths in hypercubes with prescribed origins and lengths
