Cite

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

MLA

Hung, Ruo-Wei, and Maw-Shang Chang. “Linear-Time Algorithms for the Hamiltonian Problems on Distance-Hereditary Graphs.” Theoretical Computer Science, vol. 341, no. 1–3, Sept. 2005, pp. 411–40. EBSCOhost, https://doi.org/10.1016/j.tcs.2005.04.009.



APA

Hung, R.-W., & Chang, M.-S. (2005). Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs. Theoretical Computer Science, 341(1–3), 411–440. https://doi.org/10.1016/j.tcs.2005.04.009



Chicago

Hung, Ruo-Wei, and Maw-Shang Chang. 2005. “Linear-Time Algorithms for the Hamiltonian Problems on Distance-Hereditary Graphs.” Theoretical Computer Science 341 (1–3): 411–40. doi:10.1016/j.tcs.2005.04.009.