Analysis of greedy algorithms on graphs with bounded degrees

Nicholas C. Wormald. Analysis of greedy algorithms on graphs with bounded degrees. Discrete Mathematics, 273(1-3):235-260, 2003. [doi]

@article{Wormald03,
  title = {Analysis of greedy algorithms on graphs with bounded degrees},
  author = {Nicholas C. Wormald},
  year = {2003},
  doi = {10.1016/S0012-365X(03)00241-3},
  url = {http://dx.doi.org/10.1016/S0012-365X(03)00241-3},
  tags = {analysis, graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/Wormald03},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {273},
  number = {1-3},
  pages = {235-260},
}