The following pages link to Ruo-Wei Hung (Q335337):
Displayed 23 items.
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph (Q391194) (← links)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes (Q638549) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- The restrained domination and independent restrained domination in extending supergrid graphs (Q2695306) (← links)
- Restrained domination and its variants in extended supergrid graphs (Q2699221) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration (Q3625782) (← links)
- Hamilton cycles in split graphs with large minimum degree (Q4823301) (← links)
- Optimal edge ranking of complete bipartite graphs in polynomial time (Q5492694) (← links)
- (Q6104844) (← links)
- The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs (Q6316698) (← links)
- Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time (Q6323943) (← links)
- The Longest $(s, t)$-paths of $O$-shaped Supergrid Graphs (Q6329512) (← links)