Priority algorithms for graph optimization problems

Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi. Priority algorithms for graph optimization problems. Theoretical Computer Science, 411(1):239-258, 2010. [doi]

@article{BorodinBLM10,
  title = {Priority algorithms for graph optimization problems},
  author = {Allan Borodin and Joan Boyar and Kim S. Larsen and Nazanin Mirmohammadi},
  year = {2010},
  doi = {10.1016/j.tcs.2009.09.033},
  url = {http://dx.doi.org/10.1016/j.tcs.2009.09.033},
  tags = {optimization, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BorodinBLM10},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {411},
  number = {1},
  pages = {239-258},
}