On Searching of Special Cases of Mazes and Finite Embedded Graphs

Armin Hemmerling, Klaus Kriegel. On Searching of Special Cases of Mazes and Finite Embedded Graphs. In Michal Chytil, Václav Koubek, editors, Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings. Volume 176 of Lecture Notes in Computer Science, pages 291-300, Springer, 1984.

@inproceedings{HemmerlingK84,
  title = {On Searching of Special Cases of Mazes and Finite Embedded Graphs},
  author = {Armin Hemmerling and Klaus Kriegel},
  year = {1984},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HemmerlingK84},
  cites = {0},
  citedby = {0},
  pages = {291-300},
  booktitle = {Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings},
  editor = {Michal Chytil and Václav Koubek},
  volume = {176},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-13372-0},
}