@article{DBLP:journals/corr/BerkholzBG15,
  author    = {Christoph Berkholz and
               Paul S. Bonsma and
               Martin Grohe},
  title     = {Tight Lower and Upper Bounds for the Complexity of Canonical Colour
               Refinement},
  journal   = {CoRR},
  volume    = {abs/1509.08251},
  year      = {2015},
  url       = {http://arxiv.org/abs/1509.08251},
  eprinttype = {arXiv},
  eprint    = {1509.08251},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BerkholzBG15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"TWxyWc2b2sP8tNPNL","bibbaseid":"berkholz-bonsma-grohe-tightlowerandupperboundsforthecomplexityofcanonicalcolourrefinement-2015","downloads":0,"creationDate":"2015-10-19T01:05:14.510Z","title":"Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement","author_short":["Berkholz, C.","Bonsma, P. S.","Grohe, M."],"year":2015,"bibtype":"article","biburl":"http://dblp.org/pers/tb2/g/Grohe:Martin","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Christoph"],"propositions":[],"lastnames":["Berkholz"],"suffixes":[]},{"firstnames":["Paul","S."],"propositions":[],"lastnames":["Bonsma"],"suffixes":[]},{"firstnames":["Martin"],"propositions":[],"lastnames":["Grohe"],"suffixes":[]}],"title":"Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement","journal":"CoRR","volume":"abs/1509.08251","year":"2015","url":"http://arxiv.org/abs/1509.08251","eprinttype":"arXiv","eprint":"1509.08251","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/BerkholzBG15.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/BerkholzBG15,\n author = {Christoph Berkholz and\n Paul S. Bonsma and\n Martin Grohe},\n title = {Tight Lower and Upper Bounds for the Complexity of Canonical Colour\n Refinement},\n journal = {CoRR},\n volume = {abs/1509.08251},\n year = {2015},\n url = {http://arxiv.org/abs/1509.08251},\n eprinttype = {arXiv},\n eprint = {1509.08251},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/BerkholzBG15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Berkholz, C.","Bonsma, P. S.","Grohe, M."],"key":"DBLP:journals/corr/BerkholzBG15","id":"DBLP:journals/corr/BerkholzBG15","bibbaseid":"berkholz-bonsma-grohe-tightlowerandupperboundsforthecomplexityofcanonicalcolourrefinement-2015","role":"author","urls":{"Paper":"http://arxiv.org/abs/1509.08251"},"metadata":{"authorlinks":{}}},"search_terms":["tight","lower","upper","bounds","complexity","canonical","colour","refinement","berkholz","bonsma","grohe"],"keywords":[],"authorIDs":["545720022abc8e9f370000a8","oWamqdovFccHcFdCZ"],"dataSources":["jS7oF7ycnJjCpQRs7"]}