Path covers of bubble-sort star graphs
Author:
- 12 April 2023
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (13) , 14848-14868
Abstract
No abstract availableKeywords
Funding Information
- China Scholarship Council (202006785015)
- Guangdong Basic and Applied Basic Research Foundation (2023A1515011049)
This publication has 38 references indexed in Scilit:
- One conjecture of bubble-sort graphsInformation Processing Letters, 2011
- One-to-one disjoint path covers on-ary-cubesTheoretical Computer Science, 2011
- The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval GraphsAlgorithmica, 2009
- Long paths in hypercubes with conditional node-faultsInformation Sciences, 2009
- Constructing vertex–disjoint paths in (n, k)-star graphsInformation Sciences, 2007
- Node-disjoint paths in hierarchical hypercube networksInformation Sciences, 2007
- An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake GraphsIEICE Transactions on Information and Systems, 2007
- Longest fault-free paths in hypercubes with vertex faultsInformation Sciences, 2006
- Constructing one-to-many disjoint paths in folded hypercubesIEEE Transactions on Computers, 2002
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989