14 results on '"Lai, Cheng-Nan"'
Search Results
2. Optimal construction of node-disjoint shortest paths in folded hypercubes
3. On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
4. Constructing all shortest node-disjoint paths in torus networks
5. Two spanning disjoint paths with required length in generalized hypercubes
6. Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
7. Constructing one-to-many disjoint paths in folded hypercubes
8. Strong Rabin numbers of folded hypercubes
9. An efficient construction of one-to-many node-disjoint paths in folded hypercubes
10. On the construction of all shortest node-disjoint paths in star networks
11. Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
12. Real-time reconfigurable cache for low-power embedded systems
13. w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
14. w-Rabin numbers and strong w-Rabin numbers of folded hypercubes.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.