A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus

Jianer Chen. A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG 92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings. Volume 657 of Lecture Notes in Computer Science, pages 103-113, Springer, 1992.

@inproceedings{Chen92:4,
  title = {A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus},
  author = {Jianer Chen},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Chen92%3A4},
  cites = {0},
  citedby = {0},
  pages = {103-113},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG  92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
  editor = {Ernst W. Mayr},
  volume = {657},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-56402-0},
}