NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)

Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher. NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). In Michel Cosnard, Afonso Ferreira, Joseph G. Peters, editors, Parallel and Distributed Computing, First Canada-France Conference, MontrĂ©al, Canada, May 19-21, 1994, Proceedings. Volume 805 of Lecture Notes in Computer Science, pages 45-57, Springer, 1994.

@inproceedings{LiangGM94,
  title = {NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)},
  author = {Y. Daniel Liang and Raymond Greenlaw and Glenn K. Manacher},
  year = {1994},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LiangGM94},
  cites = {0},
  citedby = {0},
  pages = {45-57},
  booktitle = {Parallel and Distributed Computing, First Canada-France Conference, Montréal, Canada, May 19-21, 1994, Proceedings},
  editor = {Michel Cosnard and Afonso Ferreira and Joseph G. Peters},
  volume = {805},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58078-6},
}