Many-to-many two-disjoint path covers in restricted hypercube-like graphs (original) (raw)
Related papers
Paired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2016
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2016
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science, 2013
Disjoint path covers with path length constraints in restricted hypercube-like graphs
Journal of Computer and System Sciences, 2017
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
IEEE Transactions on Parallel and Distributed Systems, 2006
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
Theoretical Computer Science, 2019
Subcube fault-tolerance in hypercubes
Information Sciences, 2013
General-demand disjoint path covers in a graph with faulty elements
International Journal of Computer Mathematics, 2012
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Theoretical Computer Science, 2013
Tolerating faults in hypercubes using subcube partitioning
IEEE Transactions on Computers, 1992
On the Existence of Disjoint Spanning Paths in Faulty Hypercubes
Journal of Interconnection Networks, 2010
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges
2011
From Hall's Matching Theorem to Optimal Routing on Hypercubes
Journal of Combinatorial Theory, Series B, 1998
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science, 2007
Vertex-fault-tolerant cycles embedding in balanced hypercubes
Information Sciences, 2014
Edge-fault-tolerant bipanconnectivity of hypercubes☆
Information Sciences, 2009
A Fault Tolerant Routing Scheme for Hypercubes
Telecommunication Systems, 2000
Fault-tolerant cycles embedding in hypercubes with faulty edges
Information Sciences, 2014
Hamiltonicity of hypercubes with a constraint of required and faulty edges
Journal of Combinatorial Optimization, 2007
Fault-tolerant routing in hypercubes using probability vectors
Parallel Computing, 2001
One-to-many node-disjoint paths in (n, k)-star graphs
Discrete Applied Mathematics, 2010
Design of gracefully degradable hypercube-connected systems
Journal of Parallel and Distributed Computing, 1992
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
IEEE Transactions on Parallel and Distributed Systems, 2008
Cycles embedding in balanced hypercubes with faulty edges and vertices
Discrete Applied Mathematics, 2018
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
19th IEEE International Parallel and Distributed Processing Symposium
Parallel Computing on Distributed Memory Multiprocessors, 1993
Hypercube subgraphs with local detours
Journal of Graph Theory, 1999
Journal of Advances in Computer Networks, 2015
Running algorithms efficiently on faulty hypercubes
Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA '90, 1990
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Inf. Process. Lett., 2021
… , IEEE Transactions on, 2010
Covering hypercubes by isometric paths
Richard Nowakowski, Ian Caines
Discrete Mathematics, 2001
A further result on fault-free cycles in faulty folded hypercubes
Information Processing Letters, 2009
Combinatorial Analysis of Star Graph Networks
1995