An Almost-Greedy Search on Random Binary Vectors and Random Graphs

Avner Dor, Eitan Greenshtein. An Almost-Greedy Search on Random Binary Vectors and Random Graphs. J. Algorithms, 40(1):102-133, 2001.

@article{DorG01,
  title = {An Almost-Greedy Search on Random Binary Vectors and Random Graphs},
  author = {Avner Dor and Eitan Greenshtein},
  year = {2001},
  tags = {graph-rewriting, rewriting, search},
  researchr = {https://researchr.org/publication/DorG01},
  cites = {0},
  citedby = {0},
  journal = {J. Algorithms},
  volume = {40},
  number = {1},
  pages = {102-133},
}