Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-40450-4_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg