Greg N. Frederickson. A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract). In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA. pages 19-28, ACM, 1987.
@inproceedings{Frederickson87:0,
title = {A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)},
author = {Greg N. Frederickson},
year = {1987},
tags = {planar graph, graph-rewriting, rewriting, systematic-approach},
researchr = {https://researchr.org/publication/Frederickson87%3A0},
cites = {0},
citedby = {0},
pages = {19-28},
booktitle = {Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA},
publisher = {ACM},
}