The following pages link to Jou-Ming Chang (Q269717):
Displayed 41 items.
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- A well-equalized 3-CIST partition of alternating group graphs (Q2281160) (← links)
- Constructing dual-CISTs of DCell data center networks (Q2286061) (← 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)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- Geodesic-pancyclic graphs (Q2381818) (← links)
- The existence and uniqueness of strong kings in tournaments (Q2427527) (← links)
- The lower and upper forcing geodetic numbers of block--cactus graphs (Q2432848) (← links)
- Fault-tolerant cycle-embedding in alternating group graphs (Q2479251) (← links)
- Vertex-transitivity on folded crossed cubes (Q2630337) (← links)
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity (Q2680983) (← links)
- Gray Codes for AT-Free Orders via Antimatroids (Q2798220) (← 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)
- Independent spanning trees on folded hyper-stars (Q3064044) (← links)
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs (Q3157040) (← links)
- (Q4511223) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
- Task scheduling with precedence constraints to minimize the total completion time (Q4859027) (← links)
- Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks (Q4963264) (← links)
- On Component Connectivity of Hierarchical Star Networks (Q4983541) (← links)
- (Q5071562) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← links)
- Independent Spanning Trees on Multidimensional Torus Networks (Q5280831) (← links)
- An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
- (Q5463350) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)
- (Q5492598) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- Matroidal connectivity and conditional matroidal connectivity of star graphs (Q6052707) (← links)
- Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms (Q6111508) (← links)
- Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes (Q6161433) (← links)
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees (Q6198997) (← links)
- Gray Codes for AT-Free Orders (Q6288079) (← links)
- The Component Connectivity of Alternating Group Graphs and Split-Stars (Q6310582) (← links)
- Strong Menger connectedness of augmented $k$-ary $n$-cubes (Q6326389) (← links)
- On the Decycling Number of Bubble-sort Star Graphs (Q6368296) (← links)