The following pages link to Kung-Jui Pai (Q300219):
Displayed 36 items.
- A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
- Incidence coloring on hypercubes (Q300251) (← links)
- Constructing two completely independent spanning trees in hypercube-variant networks (Q338381) (← links)
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
- Corrigendum to: ``Incidence coloring on hypercubes''. (Q517026) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- Two kinds of generalized 3-connectivities of alternating group networks (Q777262) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- Erratum to ``A new upper bound on the queuenumber of hypercubes'' [Discrete Math. 310, No. 4, 935-939 (2010; Zbl 1231.05190)] (Q973136) (← links)
- A note on ``An improved upper bound on the queue number of the hypercube'' (Q975418) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Improving the diameters of completely independent spanning trees in locally twisted cubes (Q1621502) (← links)
- A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks (Q1699757) (← links)
- The 4-component connectivity of alternating group networks (Q1731848) (← links)
- Constructing independent spanning trees on bubble-sort networks (Q1790945) (← links)
- A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (Q2039695) (← links)
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Comments on: ``A Hamilton sufficient condition for completely independent spanning tree'' (Q2192125) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- A well-equalized 3-CIST partition of alternating group graphs (Q2281160) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Constructing three completely independent spanning trees in locally twisted cubes (Q2327090) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Vertex-transitivity on folded crossed cubes (Q2630337) (← links)
- Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes (Q2695301) (← links)
- A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- A tree structure for local diagnosis in multiprocessor systems under the comparison model (Q6190001) (← links)
- On the Orbits of Crossed Cubes (Q6289276) (← links)