The following pages link to Hyeong-Seok Lim (Q266950):
Displaying 16 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- An approach to conditional diagnosability analysis under the PMC model and its application to torus networks (Q401484) (← links)
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements (Q884473) (← links)
- Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
- Embedding trees in recursive circulants (Q1923603) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← links)
- An efficient similarity search based on indexing in large DNA databases (Q2362456) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees (Q2701746) (← links)
- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information (Q3507318) (← links)
- A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays (Q3612575) (← links)
- (Q4427182) (← links)
- (Q4427279) (← links)
