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

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]

@article{Hsieh04:0,
  title = {An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs },
  author = {Sun-Yuan Hsieh},
  year = {2004},
  doi = {10.1016/j.jpdc.2004.03.014},
  url = {http://dx.doi.org/10.1016/j.jpdc.2004.03.014},
  tags = {graph-rewriting, rewriting, rewriting strategies},
  researchr = {https://researchr.org/publication/Hsieh04%3A0},
  cites = {0},
  citedby = {0},
  journal = {J. Parallel Distrib. Comput.},
  volume = {64},
  number = {5},
  pages = {662-685},
}