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
Open PDFAbstract
Available in full text
Date
January 1, 2013
Authors
Publisher
Springer Berlin Heidelberg