How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions

Shimon Even, Yachin Pnueli. How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions. In Joshua Maor, Abraham Peled, editors, Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, Jerusalem, October 22-25, 1990. pages 414-425, IEEE, 1990. [doi]

@inproceedings{EvenP90,
  title = {How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions},
  author = {Shimon Even and Yachin Pnueli},
  year = {1990},
  url = {http://dl.acm.org/citation.cfm?id=100585},
  researchr = {https://researchr.org/publication/EvenP90},
  cites = {0},
  citedby = {0},
  pages = {414-425},
  booktitle = {Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, Jerusalem, October 22-25, 1990},
  editor = {Joshua Maor and Abraham Peled},
  publisher = {IEEE},
  isbn = {0-8186-2078-1},
}