An O(nm)-time certifying algorithm for recognizing HHD-free graphs

Stavros D. Nikolopoulos, Leonidas Palios. An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theoretical Computer Science, 452:117-131, 2012. [doi]

@article{NikolopoulosP12,
  title = {An O(nm)-time certifying algorithm for recognizing HHD-free graphs},
  author = {Stavros D. Nikolopoulos and Leonidas Palios},
  year = {2012},
  doi = {10.1016/j.tcs.2012.06.006},
  url = {http://dx.doi.org/10.1016/j.tcs.2012.06.006},
  researchr = {https://researchr.org/publication/NikolopoulosP12},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {452},
  pages = {117-131},
}