Isomorphism testing for embeddable graphs through definability. Grohe, M. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 63–72, 2000.
Isomorphism testing for embeddable graphs through definability [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/stoc/Grohe00,
  author    = {Martin Grohe},
  title     = {Isomorphism testing for embeddable graphs through definability},
  booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  pages     = {63--72},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {https://doi.org/10.1145/335305.335313},
  doi       = {10.1145/335305.335313},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/Grohe00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0