Clik here to view.
Hamiltonian Cycle Problem on Distance-Hereditary Graphs.
Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang: Hamiltonian Cycle Problem on Distance-Hereditary Graphs. J. Inf. Sci. Eng. 19(5): 827-838 (2003)
View ArticleClik here to view.
A simple linear algorithm for the connected domination problem in...
Maw-Shang Chang, Ruo-Wei Hung: A simple linear algorithm for the connected domination problem in circular-arc graphs. Discuss. Math. Graph Theory 24(1): 137-145 (2004)
View ArticleClik here to view.
Linear-time algorithms for the Hamiltonian problems on distance-hereditary...
Ruo-Wei Hung, Maw-Shang Chang: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . Theor. Comput. Sci. 341(1-3): 411-440 (2005)
View ArticleClik here to view.
Optimal edge ranking of complete bipartite graphs in polynomial time.
Ruo-Wei Hung: Optimal edge ranking of complete bipartite graphs in polynomial time. Discuss. Math. Graph Theory 26(1): 149-159 (2006)
View ArticleClik here to view.
Solving the path cover problem on circular-arc graphs by using an...
Ruo-Wei Hung, Maw-Shang Chang: Solving the path cover problem on circular-arc graphs by using an approximation algorithm. Discret. Appl. Math. 154(1): 76-105 (2006)
View ArticleClik here to view.
Finding a minimum path cover of a distance-hereditary graph in polynomial time.
Ruo-Wei Hung, Maw-Shang Chang: Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discret. Appl. Math. 155(17): 2242-2256 (2007)
View ArticleClik here to view.
Optimal vertex ranking of block graphs.
Ruo-Wei Hung: Optimal vertex ranking of block graphs. Inf. Comput. 206(11): 1288-1302 (2008)
View ArticleClik here to view.
Extractive Support Vector Algorithm on Support Vector Machines for Image...
Chih-Chia Yao, Pao-Ta Yu, Ruo-Wei Hung: Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration. Fundam. Informaticae 90(1-2): 171-190 (2009)
View ArticleClik here to view.
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes.
Ruo-Wei Hung: Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes. CoRR abs/1010.2466 (2010)
View ArticleClik here to view.
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint...
Ruo-Wei Hung: Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes. CoRR abs/1006.3909 (2010)
View ArticleClik here to view.
Certifying Algorithms for the Path Cover and Related Problems on Interval...
Ruo-Wei Hung, Maw-Shang Chang: Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. ICCSA (2) 2010: 314-323
View ArticleClik here to view.
An efficient certifying algorithm for the Hamiltonian cycle problem on...
Ruo-Wei Hung, Maw-Shang Chang: An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theor. Comput. Sci. 412(39): 5351-5373 (2011)
View ArticleClik here to view.
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes.
Ruo-Wei Hung: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. Theor. Comput. Sci. 412(35): 4747-4753 (2011)
View ArticleClik here to view.
Linear-time algorithm for the matched-domination problem in cographs.
Ruo-Wei Hung, Chih-Chia Yao: Linear-time algorithm for the matched-domination problem in cographs. Int. J. Comput. Math. 88(10): 2042-2056 (2011)
View ArticleClik here to view.
Linear-time certifying algorithms for the path cover and Hamiltonian cycle...
Ruo-Wei Hung, Maw-Shang Chang: Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. Appl. Math. Lett. 24(5): 648-652 (2011)
View ArticleClik here to view.
Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite...
Ruo-Wei Hung: Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. Theory Comput. Syst. 50(4): 721-738 (2012)
View ArticleClik here to view.
DVcube: A novel compound architecture of disc-ring graph and hypercube-like...
Ruo-Wei Hung: DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph. Theor. Comput. Sci. 498: 28-45 (2013)
View ArticleClik here to view.
Hamiltonian Cycles in Linear-Convex Supergrid Graphs.
Ruo-Wei Hung: Hamiltonian Cycles in Linear-Convex Supergrid Graphs. CoRR abs/1506.00190 (2015)
View ArticleClik here to view.
The Hamiltonian Property of Linear-Convex Supergrid Graphs.
Ruo-Wei Hung, Jun-Lin Li, Hao-Yu Chih, Chien-Hui Hou: The Hamiltonian Property of Linear-Convex Supergrid Graphs. CANDAR 2015: 103-109
View ArticleClik here to view.
The Hamiltonian properties of supergrid graphs.
Ruo-Wei Hung, Chih-Chia Yao, Shang-Ju Chan: The Hamiltonian properties of supergrid graphs. Theor. Comput. Sci. 602: 132-148 (2015)
View Article
