Ruo-Wei Hung

activity

20092019

most citedThe Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs

5 citations · 5 across the 6 of their papers we have counts for

collaborators

Showing 2010 · cs.DCShow all

2 papers · 2 filters

cs.DC2010

Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes

Ruo-Wei Hung

The $n$ -dimensional hypercube network $Q_{n}$ is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$ -dimensional locally…

cs.DC2010

Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes

Ruo-Wei Hung

The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$ -dimensional twisted cube, denoted by $T Q_{n}$ , an im…