Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement ; day:27 ; month:6 ; year:2016 ; pages:1-34
Theory of computing systems ; (27.6.2016), 1-34
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.1007/s00224-016-9686-0
- URN
-
urn:nbn:de:1111-201606288573
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Berkholz, Christoph
- Bonsma, Paul
- Grohe, Martin
- SpringerLink (Online service)
Ähnliche Objekte (12)
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Albums and bound volumes of colour-prints
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Real Enumerative Invariants Relative to the Anti-Canonical Divisor and their Refinement
A tight lower bound for semi-synchronous collaborative grid exploration
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Albums and bound volumes of colour-prints
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Real Enumerative Invariants Relative to the Anti-Canonical Divisor and their Refinement
A tight lower bound for semi-synchronous collaborative grid exploration
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Albums and bound volumes of colour-prints
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Real Enumerative Invariants Relative to the Anti-Canonical Divisor and their Refinement