On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs

Andrzej Lingas, Andrzej Proskurowski. On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. Theoretical Computer Science, 68(2):155-173, 1989.

@article{LingasP89,
  title = {On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs},
  author = {Andrzej Lingas and Andrzej Proskurowski},
  year = {1989},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LingasP89},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {68},
  number = {2},
  pages = {155-173},
}