On Graph Kernels: Hardness Results and Efficient Alternatives

Gärtner et al. "On Graph Kernels: Hardness Results and Efficient Alternatives." Annual Conference on Computational Learning Theory, 2003. doi:10.1007/978-3-540-45167-9_11

[Gärtner et al. "On Graph Kernels: Hardness Results and Efficient Alternatives." Annual Conference on Computational Learning Theory, 2003.](https://mlanthology.org/colt/2003/gartner2003colt-graph/) doi:10.1007/978-3-540-45167-9_11

@inproceedings{gartner2003colt-graph,
  title     = {{On Graph Kernels: Hardness Results and Efficient Alternatives}},
  author    = {Gärtner, Thomas and Flach, Peter A. and Wrobel, Stefan},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2003},
  pages     = {129-143},
  doi       = {10.1007/978-3-540-45167-9_11},
  url       = {https://mlanthology.org/colt/2003/gartner2003colt-graph/}
}