Jürgen Eckerle, Sven Schuierer. Efficient Memory-Limited Graph Search. In Ipke Wachsmuth, Claus-Rainer Rollinger, Wilfried Brauer, editors, KI-95: Advances in Artificial Intelligence, 19th Annual German Conference on Artificial Intelligence, Bielefeld, Germany, September 11-13, 1995, Proceedings. Volume 981 of Lecture Notes in Computer Science, pages 101-112, Springer, 1995.
@inproceedings{EckerleS95,
title = {Efficient Memory-Limited Graph Search},
author = {Jürgen Eckerle and Sven Schuierer},
year = {1995},
tags = {graph-rewriting, rewriting, search},
researchr = {https://researchr.org/publication/EckerleS95},
cites = {0},
citedby = {0},
pages = {101-112},
booktitle = {KI-95: Advances in Artificial Intelligence, 19th Annual German Conference on Artificial Intelligence, Bielefeld, Germany, September 11-13, 1995, Proceedings},
editor = {Ipke Wachsmuth and Claus-Rainer Rollinger and Wilfried Brauer},
volume = {981},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60343-3},
}