@article{DBLP:journals/mst/BerkholzBG17,
  author    = {Christoph Berkholz and
               Paul S. Bonsma and
               Martin Grohe},
  title     = {Tight Lower and Upper Bounds for the Complexity of Canonical Colour
               Refinement},
  journal   = {Theory Comput. Syst.},
  volume    = {60},
  number    = {4},
  pages     = {581--614},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00224-016-9686-0},
  doi       = {10.1007/s00224-016-9686-0},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/BerkholzBG17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"wffFjhz4hMcgfDHif","bibbaseid":"berkholz-bonsma-grohe-tightlowerandupperboundsforthecomplexityofcanonicalcolourrefinement-2017","downloads":0,"creationDate":"2017-05-18T22:44:01.035Z","title":"Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement","author_short":["Berkholz, C.","Bonsma, P. S.","Grohe, M."],"year":2017,"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":"Theory Comput. Syst.","volume":"60","number":"4","pages":"581–614","year":"2017","url":"https://doi.org/10.1007/s00224-016-9686-0","doi":"10.1007/s00224-016-9686-0","timestamp":"Sun, 02 Jun 2019 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/mst/BerkholzBG17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/mst/BerkholzBG17,\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 = {Theory Comput. Syst.},\n volume = {60},\n number = {4},\n pages = {581--614},\n year = {2017},\n url = {https://doi.org/10.1007/s00224-016-9686-0},\n doi = {10.1007/s00224-016-9686-0},\n timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/mst/BerkholzBG17.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/mst/BerkholzBG17","id":"DBLP:journals/mst/BerkholzBG17","bibbaseid":"berkholz-bonsma-grohe-tightlowerandupperboundsforthecomplexityofcanonicalcolourrefinement-2017","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00224-016-9686-0"},"metadata":{"authorlinks":{}}},"search_terms":["tight","lower","upper","bounds","complexity","canonical","colour","refinement","berkholz","bonsma","grohe"],"keywords":[],"authorIDs":["oWamqdovFccHcFdCZ"],"dataSources":["jS7oF7ycnJjCpQRs7"]}