The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks
Authors:
- Ruichao NiuRNRuichao Niu
- Min XuMXMin Xu
- 14 February 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 911, 26-40
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61373021)
- National Natural Science Foundation of China (11571044)
This publication has 16 references indexed in Scilit:
- Paired many-to-many disjoint path covers in faulty hypercubesTheoretical Computer Science, 2013
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphsInformation Sciences, 2013
- FAULT-TOLERANT HAMILTONIAN LACEABILITY AND FAULT-TOLERANT CONDITIONAL HAMILTONIAN FOR BIPARTITE HYPERCUBE-LIKE NETWORKSJournal of Interconnection Networks, 2009
- Many-to-many disjoint paths in faulty hypercubesInformation Sciences, 2009
- The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval GraphsAlgorithmica, 2009
- On the spanning connectivity and spanning laceability of hypercube-like networksTheoretical Computer Science, 2007
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elementsTheoretical Computer Science, 2007
- Hamiltonian properties on the class of hypercube-like networksInformation Processing Letters, 2004
- The Mobius cubesIEEE Transactions on Computers, 1995
- A variation on the hypercube with lower diameterIEEE Transactions on Computers, 1991