Update Networks and Their Routing Strategies

Michael J. Dinneen, Bakhadyr Khoussainov. Update Networks and Their Routing Strategies. In Ulrik Brandes, Dorothea Wagner, editors, Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings. Volume 1928 of Lecture Notes in Computer Science, pages 127-136, Springer, 2000. [doi]

@inproceedings{DinneenK00,
  title = {Update Networks and Their Routing Strategies},
  author = {Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1928/19280127.htm},
  tags = { finite graphs, networks, meta-model, update games, strategies, graph-rewriting, information models, Meta-Environment, rewriting, routing,  infinite games, rewriting strategies},
  researchr = {https://researchr.org/publication/DinneenK00},
  cites = {0},
  citedby = {0},
  pages = {127-136},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
  editor = {Ulrik Brandes and Dorothea Wagner},
  volume = {1928},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41183-6},
}