Paired 2-disjoint path covers of balanced hypercube under the partitioned edge fault model
- 11 December 2024
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-28
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (Nos. 61977016)
- Natural Science Foundation of Fujian Province (Nos. 2020J01164)
- Fujian Alliance of Mathematics (No. 2023SXLMMS04)
- China Scholarship Council (CSC No. 202108350054)
This publication has 50 references indexed in Scilit:
- Path covers of bubble-sort star graphsThe Journal of Supercomputing, 2023
- RNE: computing shortest paths using road network embeddingThe VLDB Journal, 2021
- Analysis of distributed database access path prediction based on recurrent neural network in internet of thingsConcurrency and Computation: Practice and Experience, 2019
- Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edgesThe Journal of Supercomputing, 2019
- Hamiltonian laceability in hypercubes with faulty edgesDiscrete Applied Mathematics, 2018
- Hyper-Hamiltonian laceability of balanced hypercubesThe Journal of Supercomputing, 2013
- Bipanconnectivity of balanced hypercubesComputers & Mathematics with Applications, 2010
- Hamiltonian-laceability of star graphsNetworks, 2000
- Parallel stereocorrelation on a reconfigurable multi-ring networkThe Journal of Supercomputing, 1996
- A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approachJournal of Parallel and Distributed Computing, 1990