"Tight Lower and Upper Bounds for the Complexity of Canonical Colour ..."

Christoph Berkholz, Paul S. Bonsma, Martin Grohe (2017)

> Home

Details and statistics

DOI: 10.1007/S00224-016-9686-0

access: open

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/BerkholzBG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BerkholzBG17
Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory Comput. Syst. 60(4): 581-614 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.