134 results on '"Pai, Kung-Jui"'
Search Results
2. Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting
3. Constructing tri-CISTs in shuffle-cubes
4. The 4-Component Connectivity of Alternating Group Networks
5. A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model
6. Subversion analyses of hierarchical networks based on (edge) neighbor connectivity
7. Constructing Tri-CISTs in Shuffle-Cubes
8. Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes
9. On the Orbits of Crossed Cubes
10. Reliability Analysis of Exchanged Hypercubes Based on the Path Connectivity
11. A Parallel Algorithm for Constructing Two Edge-Disjoint Hamiltonian Cycles in Crossed Cubes
12. Three completely independent spanning trees of crossed cubes with application to secure-protection routing
13. Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks
14. Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes
15. Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes
16. A protection routing with secure mechanism in Möbius cubes
17. A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks
18. Three Edge-Disjoint Hamiltonian Cycles in Folded Locally Twisted Cubes and Folded Crossed Cubes with Applications to All-to-All Broadcasting
19. Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
20. Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
21. Constructing Independent Spanning Trees on Bubble-Sort Networks
22. Two Kinds of Generalized 3-Connectivities of Alternating Group Networks
23. Dual Protection Routing Trees on Graphs
24. A Parallel Algorithm for Constructing Two Edge-Disjoint Hamiltonian Cycles in Crossed Cubes
25. A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks
26. A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
27. Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
28. Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes
29. Two Kinds of Generalized 3-Connectivities of Alternating Group Networks
30. Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting
31. Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing
32. Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs
33. A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously
34. 3-Rainbow Domination Number in Graphs
35. Incidence coloring on hypercubes
36. A loopless algorithm for generating multiple binary tree sequences simultaneously
37. A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
38. A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks
39. Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks
40. Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
41. Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting
42. Amortized efficiency of generating planar paths in convex position
43. Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
44. Constructing dual-CISTs of folded divide-and-swap cubes
45. Comments on “A Hamilton sufficient condition for completely independent spanning tree”
46. A well-equalized 3-CIST partition of alternating group graphs
47. A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes
48. A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously
49. Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs
50. Improving the diameters of completely independent spanning trees in locally twisted cubes
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.