An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems

A. S. Nepomniaschaya. An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems. In Dines Bjørner, Manfred Broy, Igor V. Pottosin, editors, Perspectives of System Informatics, Second International Andrei Ershov Memorial Conference, Akademgorodok, Novosibirsk, Russia, June 25-28, 1996, Proceedings. Volume 1181 of Lecture Notes in Computer Science, pages 203-213, Springer, 1996.

@inproceedings{Nepomniaschaya96:0,
  title = {An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems},
  author = {A. S. Nepomniaschaya},
  year = {1996},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Nepomniaschaya96%3A0},
  cites = {0},
  citedby = {0},
  pages = {203-213},
  booktitle = {Perspectives of System Informatics, Second International Andrei Ershov Memorial Conference, Akademgorodok, Novosibirsk, Russia, June 25-28, 1996, Proceedings},
  editor = {Dines Bjørner and Manfred Broy and Igor V. Pottosin},
  volume = {1181},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-62064-8},
}