An Efficient Erew Algorithm for Minimum Path Cover and Hamiltonicity on Cographs. Lin, R., Olariu, S., Schwing, J. L., & Zhang, J. Parallel Algorithms Appl., 2(1-2):99-113, 1994.
An Efficient Erew Algorithm for Minimum Path Cover and Hamiltonicity on Cographs [link]Link  bibtex   
@article{ DBLP:journals/paapp/LinOSZ94,
  author    = {Rong Lin and Stephan Olariu and James L. Schwing and Jingyuan Zhang},
  title     = {An Efficient Erew Algorithm for Minimum Path Cover and Hamiltonicity on Cographs},
  journal   = {Parallel Algorithms Appl.},
  pages   = {99-113},
  volume   = {2},
  number   = {1-2},
  ee   = {http://dx.doi.org/10.1080/10637199408915409} ,
  year   = {1994}
}

Downloads: 0