The Complexity of Determining Paths of Length k

Burkhard Monien. The Complexity of Determining Paths of Length k. In Manfred Nagl, Jürgen Perl, editors, Proceedings WG 83, Workshop on Graphtheoretic Concepts in Computer Science, Haus Ohrbeck (near Osnabrück), Germany. pages 241-251, Trauner, Linz, 1983.

@inproceedings{Monien83-0,
  title = {The Complexity of Determining Paths of Length k},
  author = {Burkhard Monien},
  year = {1983},
  researchr = {https://researchr.org/publication/Monien83-0},
  cites = {0},
  citedby = {0},
  pages = {241-251},
  booktitle = {Proceedings WG  83, Workshop on Graphtheoretic Concepts in Computer Science, Haus Ohrbeck (near Osnabrück), Germany},
  editor = {Manfred Nagl and Jürgen Perl},
  publisher = {Trauner, Linz},
  isbn = {3-853-20311-6},
}