The following pages link to Sun-Yuan Hsieh (Q269483):
Displaying 50 items.
- Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges (Q269484) (← links)
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks (Q355511) (← links)
- Extraconnectivity of \(k\)-ary \(n\)-cube networks (Q442246) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- \(h\)-restricted connectivity of locally twisted cubes (Q516833) (← links)
- Embedding longest fault-free paths onto star graphs with more vertex faults (Q557839) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- Edge-bipancyclicity of star graphs with faulty elements (Q650935) (← links)
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults (Q733731) (← links)
- The interval-merging problem (Q867634) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes (Q906388) (← links)
- Edge-bipancyclicity of a hypercube with faulty vertices and edges (Q944732) (← links)
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes (Q967363) (← links)
- A note on cycle embedding in folded hypercubes with faulty elements (Q975405) (← links)
- Conditional edge-fault Hamiltonicity of augmented cubes (Q985082) (← links)
- A further result on fault-free cycles in faulty folded hypercubes (Q990097) (← links)
- Cycle embedding of augmented cubes (Q990439) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes (Q991233) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074) (← links)
- An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees (Q1268797) (← links)
- (Q1603538) (redirect page) (← links)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Random and conditional \((t,k)\)-diagnosis of hypercubes (Q1679217) (← links)
- The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model (Q1747484) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs (Q1881305) (← links)
- The internal Steiner tree problem: Hardness and approximations (Q1931427) (← links)
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults (Q1939282) (← links)
- Vulnerability of super extra edge-connected graphs (Q2009643) (← links)
- Constructing independent spanning trees in alternating group networks (Q2019456) (← links)
- A survey for conditional diagnosability of alternating group networks (Q2019515) (← links)
- Characterization of component diagnosability of regular networks (Q2081491) (← links)
- Pancake graphs: structural properties and conditional diagnosability (Q2091097) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Multilevel length-based classified index table for IP lookups and updates (Q2186815) (← links)
- \( R_3\)-connectivity of folded hypercubes (Q2197430) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults (Q2268760) (← links)
- On the \(g\)-good-neighbor connectivity of graphs (Q2283037) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Performance evaluation on hybrid fault diagnosability of regular networks (Q2333793) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
