A General Scheme for Breadth-First Graph Traversal

Martin Russling. A General Scheme for Breadth-First Graph Traversal. In Bernhard Möller, editor, Mathematics of Program Construction, MPC 95, Kloster Irsee, Germany, July 17-21, 1995, Proceedings. Volume 947 of Lecture Notes in Computer Science, pages 380-398, Springer, 1995.

@inproceedings{Russling95,
  title = {A General Scheme for Breadth-First Graph Traversal},
  author = {Martin Russling},
  year = {1995},
  tags = {traversal, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Russling95},
  cites = {0},
  citedby = {0},
  pages = {380-398},
  booktitle = {Mathematics of Program Construction, MPC 95, Kloster Irsee, Germany, July 17-21, 1995, Proceedings},
  editor = {Bernhard Möller},
  volume = {947},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-60117-1},
}