Finding Small Simple Cycle Separators for 2-Connected Planar Graphs

Gary L. Miller. Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, 1984, Washington, D.C., USA. pages 376-382, ACM, 1984.

@inproceedings{Miller84:2,
  title = {Finding Small Simple Cycle Separators for 2-Connected Planar Graphs},
  author = {Gary L. Miller},
  year = {1984},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Miller84%3A2},
  cites = {0},
  citedby = {0},
  pages = {376-382},
  booktitle = {Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, 1984, Washington, D.C., USA},
  publisher = {ACM},
}