An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Sun-Yuan Hsieh. An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs . J. Parallel Distrib. Comput., 64(5):662-685, 2004. [doi]

The following publications are possibly variants of this publication:

Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary GraphsSun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko. cocoon 2002: 77-86 [doi]

An efficient parallel strategy for the perfect domination problem on distance-hereditary graphsSun-Yuan Hsieh. tjs, 39(1):39-57, 2007. [doi]

The Hamiltonian problem on distance-hereditary graphsSun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko. DAM, 154(3):508-524, 2006. [doi]

An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary GraphsSun-Yuan Hsieh. tpds, 13(9):985-993, 2002. [doi]

Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary GraphsSun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen. siamdm, 15(4):488-518, 2002. [doi]

. Efficient Parallel Algorithms on Distance-Hereditary GraphsSun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko. icpp 1997: 20 [doi]

Efficient Parallel Algorithms on Distance Hereditary GraphsSun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen. ppl, 9(1):43-52, 1999.

runs on WebDSL