Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs

Andrzej Lingas. Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs. In Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, editors, Algorithms, International Symposium SIGAL 90, Tokyo, Japan, August 16-18, 1990, Proceedings. Volume 450 of Lecture Notes in Computer Science, pages 447-457, Springer, 1990.

@inproceedings{Lingas90:0,
  title = {Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs},
  author = {Andrzej Lingas},
  year = {1990},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Lingas90%3A0},
  cites = {0},
  citedby = {0},
  pages = {447-457},
  booktitle = {Algorithms, International Symposium SIGAL  90, Tokyo, Japan, August 16-18, 1990, Proceedings},
  editor = {Tetsuo Asano and Toshihide Ibaraki and Hiroshi Imai and Takao Nishizeki},
  volume = {450},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-52921-7},
}