Edge search in graphs and hypergraphs of bounded rank

Ingo Althöfer, Eberhard Triesch. Edge search in graphs and hypergraphs of bounded rank. Discrete Mathematics, 115(1-3):1-9, 1993. [doi]

@article{AlthoferT93,
  title = {Edge search in graphs and hypergraphs of bounded rank},
  author = {Ingo Althöfer and Eberhard Triesch},
  year = {1993},
  doi = {10.1016/0012-365X(93)90473-7},
  url = {http://dx.doi.org/10.1016/0012-365X(93)90473-7},
  tags = {graph-rewriting, rewriting, search},
  researchr = {https://researchr.org/publication/AlthoferT93},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {115},
  number = {1-3},
  pages = {1-9},
}