A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms

Horst Wedde. A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms. In Gottfried Tinhofer, Gunther Schmidt, editors, Graphtheoretic Concepts in Computer Science, International Workshop, WG 86, Bernried, Germany, June 17-19, 1986, Proceedings. Volume 246 of Lecture Notes in Computer Science, pages 204-226, Springer, 1986.

@inproceedings{Wedde86,
  title = {A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms},
  author = {Horst Wedde},
  year = {1986},
  tags = {graph-rewriting, rewriting, systematic-approach},
  researchr = {https://researchr.org/publication/Wedde86},
  cites = {0},
  citedby = {0},
  pages = {204-226},
  booktitle = {Graphtheoretic Concepts in Computer Science, International Workshop, WG  86, Bernried, Germany, June 17-19, 1986,  Proceedings},
  editor = {Gottfried Tinhofer and Gunther Schmidt},
  volume = {246},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-17218-1},
}